./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/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 ec62b1fa1dfab5118959156fde533654a621048a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0cd3be1 [2018-11-28 11:17:42,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:17:42,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:17:42,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:17:42,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:17:42,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:17:42,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:17:42,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:17:42,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:17:42,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:17:42,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:17:42,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:17:42,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:17:42,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:17:42,896 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:17:42,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:17:42,897 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:17:42,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:17:42,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:17:42,900 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:17:42,901 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:17:42,902 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:17:42,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:17:42,904 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:17:42,904 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:17:42,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:17:42,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:17:42,906 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:17:42,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:17:42,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:17:42,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:17:42,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:17:42,908 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:17:42,908 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:17:42,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:17:42,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:17:42,909 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:17:42,919 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:17:42,919 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:17:42,920 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:17:42,920 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:17:42,920 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:17:42,920 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:17:42,921 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:17:42,921 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:17:42,921 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:17:42,921 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:17:42,921 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:17:42,921 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:17:42,921 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:17:42,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:17:42,922 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:17:42,922 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:17:42,922 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:17:42,922 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:17:42,922 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:17:42,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:17:42,922 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:17:42,922 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:17:42,923 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:17:42,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:17:42,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:17:42,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:17:42,923 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:17:42,923 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:17:42,923 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:17:42,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:17:42,923 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_1112afb3-4dfc-4381-86f8-b712f28c386b/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 -> ec62b1fa1dfab5118959156fde533654a621048a [2018-11-28 11:17:42,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:17:42,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:17:42,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:17:42,960 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:17:42,960 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:17:42,961 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc_false-unreach-call.i [2018-11-28 11:17:43,003 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/data/0c35a9821/442635c1041a46fbaea80442ed2fbc78/FLAG6095ed500 [2018-11-28 11:17:43,338 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:17:43,339 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc_false-unreach-call.i [2018-11-28 11:17:43,346 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/data/0c35a9821/442635c1041a46fbaea80442ed2fbc78/FLAG6095ed500 [2018-11-28 11:17:43,356 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/data/0c35a9821/442635c1041a46fbaea80442ed2fbc78 [2018-11-28 11:17:43,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:17:43,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:17:43,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:17:43,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:17:43,362 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:17:43,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6c5ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43, skipping insertion in model container [2018-11-28 11:17:43,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:17:43,399 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:17:43,639 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:17:43,706 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:17:43,756 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:17:43,801 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:17:43,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43 WrapperNode [2018-11-28 11:17:43,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:17:43,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:17:43,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:17:43,803 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:17:43,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:17:43,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:17:43,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:17:43,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:17:43,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (1/1) ... [2018-11-28 11:17:43,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:17:43,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:17:43,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:17:43,882 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:17:43,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/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-11-28 11:17:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:17:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:17:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 11:17:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:17:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 11:17:43,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 11:17:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 11:17:43,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 11:17:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 11:17:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:17:43,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:17:43,933 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 11:17:44,566 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:17:44,566 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 11:17:44,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:44 BoogieIcfgContainer [2018-11-28 11:17:44,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:17:44,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:17:44,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:17:44,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:17:44,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:17:43" (1/3) ... [2018-11-28 11:17:44,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22db7ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:17:44, skipping insertion in model container [2018-11-28 11:17:44,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:43" (2/3) ... [2018-11-28 11:17:44,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22db7ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:17:44, skipping insertion in model container [2018-11-28 11:17:44,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:44" (3/3) ... [2018-11-28 11:17:44,573 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_pso.oepc_false-unreach-call.i [2018-11-28 11:17:44,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,610 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,610 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,610 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,611 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,611 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,612 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,617 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,617 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,619 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:17:44,672 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 11:17:44,672 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:17:44,678 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 11:17:44,689 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 11:17:44,707 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:17:44,707 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:17:44,707 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:17:44,707 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:17:44,707 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:17:44,707 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:17:44,707 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:17:44,708 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:17:44,708 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:17:44,717 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 226places, 306 transitions [2018-11-28 11:17:59,200 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 148584 states. [2018-11-28 11:17:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 148584 states. [2018-11-28 11:17:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 11:17:59,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:17:59,208 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] [2018-11-28 11:17:59,209 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:17:59,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:17:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash -614504401, now seen corresponding path program 1 times [2018-11-28 11:17:59,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:17:59,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:17:59,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:17:59,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:17:59,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:17:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:17:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:17:59,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:17:59,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:17:59,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:17:59,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:17:59,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:17:59,393 INFO L87 Difference]: Start difference. First operand 148584 states. Second operand 4 states. [2018-11-28 11:18:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:01,312 INFO L93 Difference]: Finished difference Result 272092 states and 1113406 transitions. [2018-11-28 11:18:01,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:18:01,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-28 11:18:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:02,171 INFO L225 Difference]: With dead ends: 272092 [2018-11-28 11:18:02,172 INFO L226 Difference]: Without dead ends: 243812 [2018-11-28 11:18:02,173 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-11-28 11:18:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243812 states. [2018-11-28 11:18:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243812 to 140486. [2018-11-28 11:18:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140486 states. [2018-11-28 11:18:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140486 states to 140486 states and 574639 transitions. [2018-11-28 11:18:10,975 INFO L78 Accepts]: Start accepts. Automaton has 140486 states and 574639 transitions. Word has length 33 [2018-11-28 11:18:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:10,975 INFO L480 AbstractCegarLoop]: Abstraction has 140486 states and 574639 transitions. [2018-11-28 11:18:10,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:18:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 140486 states and 574639 transitions. [2018-11-28 11:18:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 11:18:10,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:10,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:18:10,983 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:10,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:10,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1643249749, now seen corresponding path program 1 times [2018-11-28 11:18:10,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:10,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:10,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:11,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:11,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:18:11,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:18:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:18:11,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:18:11,057 INFO L87 Difference]: Start difference. First operand 140486 states and 574639 transitions. Second operand 4 states. [2018-11-28 11:18:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:11,358 INFO L93 Difference]: Finished difference Result 33560 states and 119400 transitions. [2018-11-28 11:18:11,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:18:11,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 11:18:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:11,419 INFO L225 Difference]: With dead ends: 33560 [2018-11-28 11:18:11,419 INFO L226 Difference]: Without dead ends: 31742 [2018-11-28 11:18:11,420 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-11-28 11:18:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31742 states. [2018-11-28 11:18:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31742 to 31742. [2018-11-28 11:18:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31742 states. [2018-11-28 11:18:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31742 states to 31742 states and 112962 transitions. [2018-11-28 11:18:12,476 INFO L78 Accepts]: Start accepts. Automaton has 31742 states and 112962 transitions. Word has length 45 [2018-11-28 11:18:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:12,476 INFO L480 AbstractCegarLoop]: Abstraction has 31742 states and 112962 transitions. [2018-11-28 11:18:12,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:18:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 31742 states and 112962 transitions. [2018-11-28 11:18:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 11:18:12,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:12,477 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] [2018-11-28 11:18:12,477 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:12,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:12,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1175559771, now seen corresponding path program 1 times [2018-11-28 11:18:12,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:12,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:12,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:12,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:12,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:18:12,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:18:12,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:18:12,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:18:12,560 INFO L87 Difference]: Start difference. First operand 31742 states and 112962 transitions. Second operand 5 states. [2018-11-28 11:18:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:13,060 INFO L93 Difference]: Finished difference Result 63360 states and 222752 transitions. [2018-11-28 11:18:13,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:18:13,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 11:18:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:13,263 INFO L225 Difference]: With dead ends: 63360 [2018-11-28 11:18:13,263 INFO L226 Difference]: Without dead ends: 63250 [2018-11-28 11:18:13,263 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-11-28 11:18:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63250 states. [2018-11-28 11:18:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63250 to 39276. [2018-11-28 11:18:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39276 states. [2018-11-28 11:18:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39276 states to 39276 states and 136384 transitions. [2018-11-28 11:18:13,948 INFO L78 Accepts]: Start accepts. Automaton has 39276 states and 136384 transitions. Word has length 46 [2018-11-28 11:18:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:13,949 INFO L480 AbstractCegarLoop]: Abstraction has 39276 states and 136384 transitions. [2018-11-28 11:18:13,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:18:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 39276 states and 136384 transitions. [2018-11-28 11:18:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 11:18:13,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:13,950 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-11-28 11:18:13,950 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:13,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:13,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1108738337, now seen corresponding path program 1 times [2018-11-28 11:18:13,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:13,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:13,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:13,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:13,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:13,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:13,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:18:13,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:18:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:18:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:18:13,992 INFO L87 Difference]: Start difference. First operand 39276 states and 136384 transitions. Second operand 3 states. [2018-11-28 11:18:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:14,247 INFO L93 Difference]: Finished difference Result 60855 states and 203999 transitions. [2018-11-28 11:18:14,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:18:14,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 11:18:14,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:14,347 INFO L225 Difference]: With dead ends: 60855 [2018-11-28 11:18:14,347 INFO L226 Difference]: Without dead ends: 60855 [2018-11-28 11:18:14,347 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-11-28 11:18:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60855 states. [2018-11-28 11:18:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60855 to 54767. [2018-11-28 11:18:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54767 states. [2018-11-28 11:18:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54767 states to 54767 states and 184631 transitions. [2018-11-28 11:18:15,543 INFO L78 Accepts]: Start accepts. Automaton has 54767 states and 184631 transitions. Word has length 48 [2018-11-28 11:18:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:15,544 INFO L480 AbstractCegarLoop]: Abstraction has 54767 states and 184631 transitions. [2018-11-28 11:18:15,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:18:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 54767 states and 184631 transitions. [2018-11-28 11:18:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 11:18:15,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:15,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:18:15,546 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:15,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash 28084908, now seen corresponding path program 1 times [2018-11-28 11:18:15,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:15,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:15,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:15,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:18:15,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:18:15,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:18:15,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:18:15,638 INFO L87 Difference]: Start difference. First operand 54767 states and 184631 transitions. Second operand 8 states. [2018-11-28 11:18:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:16,510 INFO L93 Difference]: Finished difference Result 69731 states and 227684 transitions. [2018-11-28 11:18:16,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:18:16,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-28 11:18:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:16,629 INFO L225 Difference]: With dead ends: 69731 [2018-11-28 11:18:16,630 INFO L226 Difference]: Without dead ends: 69607 [2018-11-28 11:18:16,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:18:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69607 states. [2018-11-28 11:18:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69607 to 56775. [2018-11-28 11:18:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56775 states. [2018-11-28 11:18:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56775 states to 56775 states and 189920 transitions. [2018-11-28 11:18:17,530 INFO L78 Accepts]: Start accepts. Automaton has 56775 states and 189920 transitions. Word has length 52 [2018-11-28 11:18:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:17,530 INFO L480 AbstractCegarLoop]: Abstraction has 56775 states and 189920 transitions. [2018-11-28 11:18:17,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:18:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 56775 states and 189920 transitions. [2018-11-28 11:18:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 11:18:17,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:17,535 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] [2018-11-28 11:18:17,535 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:17,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1485356584, now seen corresponding path program 1 times [2018-11-28 11:18:17,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:17,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:17,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:17,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:17,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:18:17,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:18:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:18:17,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:18:17,615 INFO L87 Difference]: Start difference. First operand 56775 states and 189920 transitions. Second operand 6 states. [2018-11-28 11:18:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:18,353 INFO L93 Difference]: Finished difference Result 110773 states and 367372 transitions. [2018-11-28 11:18:18,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:18:18,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-28 11:18:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:18,550 INFO L225 Difference]: With dead ends: 110773 [2018-11-28 11:18:18,550 INFO L226 Difference]: Without dead ends: 110717 [2018-11-28 11:18:18,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:18:18,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110717 states. [2018-11-28 11:18:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110717 to 72935. [2018-11-28 11:18:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72935 states. [2018-11-28 11:18:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72935 states to 72935 states and 238398 transitions. [2018-11-28 11:18:20,095 INFO L78 Accepts]: Start accepts. Automaton has 72935 states and 238398 transitions. Word has length 62 [2018-11-28 11:18:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:20,096 INFO L480 AbstractCegarLoop]: Abstraction has 72935 states and 238398 transitions. [2018-11-28 11:18:20,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:18:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 72935 states and 238398 transitions. [2018-11-28 11:18:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 11:18:20,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:20,103 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] [2018-11-28 11:18:20,103 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:20,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash -260667191, now seen corresponding path program 1 times [2018-11-28 11:18:20,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:20,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:20,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:20,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:20,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 11:18:20,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:18:20,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:18:20,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:18:20,235 INFO L87 Difference]: Start difference. First operand 72935 states and 238398 transitions. Second operand 9 states. [2018-11-28 11:18:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:21,858 INFO L93 Difference]: Finished difference Result 96796 states and 308161 transitions. [2018-11-28 11:18:21,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 11:18:21,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-28 11:18:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:22,009 INFO L225 Difference]: With dead ends: 96796 [2018-11-28 11:18:22,009 INFO L226 Difference]: Without dead ends: 96724 [2018-11-28 11:18:22,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2018-11-28 11:18:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96724 states. [2018-11-28 11:18:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96724 to 81133. [2018-11-28 11:18:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81133 states. [2018-11-28 11:18:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81133 states to 81133 states and 261702 transitions. [2018-11-28 11:18:23,162 INFO L78 Accepts]: Start accepts. Automaton has 81133 states and 261702 transitions. Word has length 68 [2018-11-28 11:18:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:23,162 INFO L480 AbstractCegarLoop]: Abstraction has 81133 states and 261702 transitions. [2018-11-28 11:18:23,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:18:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 81133 states and 261702 transitions. [2018-11-28 11:18:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 11:18:23,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:23,175 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] [2018-11-28 11:18:23,175 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:23,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:23,175 INFO L82 PathProgramCache]: Analyzing trace with hash -760398597, now seen corresponding path program 1 times [2018-11-28 11:18:23,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:23,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:23,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:23,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:23,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:23,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:23,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 11:18:23,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:18:23,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:18:23,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:18:23,281 INFO L87 Difference]: Start difference. First operand 81133 states and 261702 transitions. Second operand 9 states. [2018-11-28 11:18:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:24,843 INFO L93 Difference]: Finished difference Result 108445 states and 342684 transitions. [2018-11-28 11:18:24,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 11:18:24,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-11-28 11:18:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:25,278 INFO L225 Difference]: With dead ends: 108445 [2018-11-28 11:18:25,278 INFO L226 Difference]: Without dead ends: 108389 [2018-11-28 11:18:25,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2018-11-28 11:18:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108389 states. [2018-11-28 11:18:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108389 to 80494. [2018-11-28 11:18:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80494 states. [2018-11-28 11:18:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80494 states to 80494 states and 259961 transitions. [2018-11-28 11:18:26,410 INFO L78 Accepts]: Start accepts. Automaton has 80494 states and 259961 transitions. Word has length 74 [2018-11-28 11:18:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:26,410 INFO L480 AbstractCegarLoop]: Abstraction has 80494 states and 259961 transitions. [2018-11-28 11:18:26,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:18:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 80494 states and 259961 transitions. [2018-11-28 11:18:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 11:18:26,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:26,426 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] [2018-11-28 11:18:26,426 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:26,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:26,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2014750299, now seen corresponding path program 1 times [2018-11-28 11:18:26,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:26,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:26,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:26,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:26,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:26,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:26,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:18:26,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:18:26,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:18:26,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:18:26,494 INFO L87 Difference]: Start difference. First operand 80494 states and 259961 transitions. Second operand 5 states. [2018-11-28 11:18:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:26,925 INFO L93 Difference]: Finished difference Result 112217 states and 365175 transitions. [2018-11-28 11:18:26,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:18:26,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-28 11:18:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:27,120 INFO L225 Difference]: With dead ends: 112217 [2018-11-28 11:18:27,120 INFO L226 Difference]: Without dead ends: 112217 [2018-11-28 11:18:27,120 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-11-28 11:18:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112217 states. [2018-11-28 11:18:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112217 to 104142. [2018-11-28 11:18:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104142 states. [2018-11-28 11:18:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104142 states to 104142 states and 338553 transitions. [2018-11-28 11:18:28,622 INFO L78 Accepts]: Start accepts. Automaton has 104142 states and 338553 transitions. Word has length 76 [2018-11-28 11:18:28,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:28,622 INFO L480 AbstractCegarLoop]: Abstraction has 104142 states and 338553 transitions. [2018-11-28 11:18:28,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:18:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 104142 states and 338553 transitions. [2018-11-28 11:18:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 11:18:28,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:28,642 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] [2018-11-28 11:18:28,642 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:28,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash -271939964, now seen corresponding path program 1 times [2018-11-28 11:18:28,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:28,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:28,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:28,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:28,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-11-28 11:18:28,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:28,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:18:28,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:18:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:18:28,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:18:28,729 INFO L87 Difference]: Start difference. First operand 104142 states and 338553 transitions. Second operand 7 states. [2018-11-28 11:18:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:30,122 INFO L93 Difference]: Finished difference Result 189824 states and 618954 transitions. [2018-11-28 11:18:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:18:30,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-11-28 11:18:30,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:30,453 INFO L225 Difference]: With dead ends: 189824 [2018-11-28 11:18:30,453 INFO L226 Difference]: Without dead ends: 189753 [2018-11-28 11:18:30,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:18:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189753 states. [2018-11-28 11:18:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189753 to 123930. [2018-11-28 11:18:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123930 states. [2018-11-28 11:18:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123930 states to 123930 states and 397571 transitions. [2018-11-28 11:18:32,530 INFO L78 Accepts]: Start accepts. Automaton has 123930 states and 397571 transitions. Word has length 76 [2018-11-28 11:18:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:32,531 INFO L480 AbstractCegarLoop]: Abstraction has 123930 states and 397571 transitions. [2018-11-28 11:18:32,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:18:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 123930 states and 397571 transitions. [2018-11-28 11:18:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 11:18:32,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:32,557 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] [2018-11-28 11:18:32,557 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:32,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:32,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2068033077, now seen corresponding path program 1 times [2018-11-28 11:18:32,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:32,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:32,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:32,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:32,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:32,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:32,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:18:32,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:18:32,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:18:32,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:18:32,622 INFO L87 Difference]: Start difference. First operand 123930 states and 397571 transitions. Second operand 4 states. [2018-11-28 11:18:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:33,357 INFO L93 Difference]: Finished difference Result 134224 states and 427691 transitions. [2018-11-28 11:18:33,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:18:33,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-28 11:18:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:33,581 INFO L225 Difference]: With dead ends: 134224 [2018-11-28 11:18:33,582 INFO L226 Difference]: Without dead ends: 134224 [2018-11-28 11:18:33,582 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-11-28 11:18:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134224 states. [2018-11-28 11:18:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134224 to 130356. [2018-11-28 11:18:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130356 states. [2018-11-28 11:18:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130356 states to 130356 states and 416512 transitions. [2018-11-28 11:18:35,543 INFO L78 Accepts]: Start accepts. Automaton has 130356 states and 416512 transitions. Word has length 80 [2018-11-28 11:18:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:35,543 INFO L480 AbstractCegarLoop]: Abstraction has 130356 states and 416512 transitions. [2018-11-28 11:18:35,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:18:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 130356 states and 416512 transitions. [2018-11-28 11:18:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 11:18:35,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:35,574 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] [2018-11-28 11:18:35,574 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:35,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 132372790, now seen corresponding path program 1 times [2018-11-28 11:18:35,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:35,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:35,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:35,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:35,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18: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-11-28 11:18:35,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:35,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:18:35,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:18:35,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:18:35,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:18:35,618 INFO L87 Difference]: Start difference. First operand 130356 states and 416512 transitions. Second operand 3 states. [2018-11-28 11:18:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:36,213 INFO L93 Difference]: Finished difference Result 132173 states and 421679 transitions. [2018-11-28 11:18:36,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:18:36,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-28 11:18:36,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:36,438 INFO L225 Difference]: With dead ends: 132173 [2018-11-28 11:18:36,438 INFO L226 Difference]: Without dead ends: 132173 [2018-11-28 11:18:36,439 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-11-28 11:18:36,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132173 states. [2018-11-28 11:18:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132173 to 131296. [2018-11-28 11:18:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131296 states. [2018-11-28 11:18:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131296 states to 131296 states and 419170 transitions. [2018-11-28 11:18:38,088 INFO L78 Accepts]: Start accepts. Automaton has 131296 states and 419170 transitions. Word has length 80 [2018-11-28 11:18:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:38,089 INFO L480 AbstractCegarLoop]: Abstraction has 131296 states and 419170 transitions. [2018-11-28 11:18:38,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:18:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 131296 states and 419170 transitions. [2018-11-28 11:18:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 11:18:38,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:38,121 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] [2018-11-28 11:18:38,121 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:38,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:38,121 INFO L82 PathProgramCache]: Analyzing trace with hash 394157484, now seen corresponding path program 1 times [2018-11-28 11:18:38,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:38,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:38,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:38,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:38,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:38,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:38,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:18:38,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:18:38,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:18:38,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:18:38,225 INFO L87 Difference]: Start difference. First operand 131296 states and 419170 transitions. Second operand 10 states. [2018-11-28 11:18:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:40,562 INFO L93 Difference]: Finished difference Result 166835 states and 524111 transitions. [2018-11-28 11:18:40,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:18:40,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-11-28 11:18:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:40,841 INFO L225 Difference]: With dead ends: 166835 [2018-11-28 11:18:40,841 INFO L226 Difference]: Without dead ends: 166759 [2018-11-28 11:18:40,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2018-11-28 11:18:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166759 states. [2018-11-28 11:18:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166759 to 127980. [2018-11-28 11:18:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127980 states. [2018-11-28 11:18:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127980 states to 127980 states and 410098 transitions. [2018-11-28 11:18:42,826 INFO L78 Accepts]: Start accepts. Automaton has 127980 states and 410098 transitions. Word has length 80 [2018-11-28 11:18:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:42,826 INFO L480 AbstractCegarLoop]: Abstraction has 127980 states and 410098 transitions. [2018-11-28 11:18:42,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:18:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 127980 states and 410098 transitions. [2018-11-28 11:18:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 11:18:42,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:42,859 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] [2018-11-28 11:18:42,859 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:42,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:42,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1341674495, now seen corresponding path program 1 times [2018-11-28 11:18:42,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:42,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:42,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:42,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:42,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:42,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:42,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:18:42,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:18:42,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:18:42,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:18:42,925 INFO L87 Difference]: Start difference. First operand 127980 states and 410098 transitions. Second operand 6 states. [2018-11-28 11:18:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:44,603 INFO L93 Difference]: Finished difference Result 139402 states and 443686 transitions. [2018-11-28 11:18:44,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:18:44,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-28 11:18:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:44,831 INFO L225 Difference]: With dead ends: 139402 [2018-11-28 11:18:44,831 INFO L226 Difference]: Without dead ends: 139402 [2018-11-28 11:18:44,831 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-11-28 11:18:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139402 states. [2018-11-28 11:18:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139402 to 135898. [2018-11-28 11:18:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135898 states. [2018-11-28 11:18:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135898 states to 135898 states and 433872 transitions. [2018-11-28 11:18:46,556 INFO L78 Accepts]: Start accepts. Automaton has 135898 states and 433872 transitions. Word has length 82 [2018-11-28 11:18:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:46,556 INFO L480 AbstractCegarLoop]: Abstraction has 135898 states and 433872 transitions. [2018-11-28 11:18:46,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:18:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 135898 states and 433872 transitions. [2018-11-28 11:18:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 11:18:46,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:46,591 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] [2018-11-28 11:18:46,591 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:46,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:46,592 INFO L82 PathProgramCache]: Analyzing trace with hash -593985792, now seen corresponding path program 1 times [2018-11-28 11:18:46,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:46,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:46,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:46,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:46,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:18:46,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:18:46,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:18:46,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:18:46,710 INFO L87 Difference]: Start difference. First operand 135898 states and 433872 transitions. Second operand 6 states. [2018-11-28 11:18:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:47,521 INFO L93 Difference]: Finished difference Result 143883 states and 451858 transitions. [2018-11-28 11:18:47,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:18:47,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-28 11:18:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:47,756 INFO L225 Difference]: With dead ends: 143883 [2018-11-28 11:18:47,757 INFO L226 Difference]: Without dead ends: 143883 [2018-11-28 11:18:47,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:18:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143883 states. [2018-11-28 11:18:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143883 to 138092. [2018-11-28 11:18:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138092 states. [2018-11-28 11:18:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138092 states to 138092 states and 437140 transitions. [2018-11-28 11:18:49,807 INFO L78 Accepts]: Start accepts. Automaton has 138092 states and 437140 transitions. Word has length 82 [2018-11-28 11:18:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:49,807 INFO L480 AbstractCegarLoop]: Abstraction has 138092 states and 437140 transitions. [2018-11-28 11:18:49,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:18:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 138092 states and 437140 transitions. [2018-11-28 11:18:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 11:18:49,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:49,847 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] [2018-11-28 11:18:49,847 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:49,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:49,847 INFO L82 PathProgramCache]: Analyzing trace with hash -264220031, now seen corresponding path program 1 times [2018-11-28 11:18:49,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:49,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:49,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:49,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:49,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:49,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-11-28 11:18:49,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:49,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:18:49,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:18:49,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:18:49,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:18:49,933 INFO L87 Difference]: Start difference. First operand 138092 states and 437140 transitions. Second operand 5 states. [2018-11-28 11:18:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:50,802 INFO L93 Difference]: Finished difference Result 160064 states and 502579 transitions. [2018-11-28 11:18:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:18:50,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-28 11:18:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:51,067 INFO L225 Difference]: With dead ends: 160064 [2018-11-28 11:18:51,067 INFO L226 Difference]: Without dead ends: 160064 [2018-11-28 11:18:51,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:18:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160064 states. [2018-11-28 11:18:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160064 to 148241. [2018-11-28 11:18:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148241 states. [2018-11-28 11:18:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148241 states to 148241 states and 466166 transitions. [2018-11-28 11:18:53,492 INFO L78 Accepts]: Start accepts. Automaton has 148241 states and 466166 transitions. Word has length 82 [2018-11-28 11:18:53,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:53,492 INFO L480 AbstractCegarLoop]: Abstraction has 148241 states and 466166 transitions. [2018-11-28 11:18:53,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:18:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 148241 states and 466166 transitions. [2018-11-28 11:18:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 11:18:53,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:53,533 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] [2018-11-28 11:18:53,533 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:53,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2020643424, now seen corresponding path program 1 times [2018-11-28 11:18:53,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:53,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:53,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:53,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:53,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:53,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:53,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:18:53,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:18:53,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:18:53,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:18:53,601 INFO L87 Difference]: Start difference. First operand 148241 states and 466166 transitions. Second operand 5 states. [2018-11-28 11:18:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:54,530 INFO L93 Difference]: Finished difference Result 177929 states and 555113 transitions. [2018-11-28 11:18:54,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:18:54,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-28 11:18:54,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:54,822 INFO L225 Difference]: With dead ends: 177929 [2018-11-28 11:18:54,822 INFO L226 Difference]: Without dead ends: 177929 [2018-11-28 11:18:54,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:18:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177929 states. [2018-11-28 11:18:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177929 to 167311. [2018-11-28 11:18:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167311 states. [2018-11-28 11:18:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167311 states to 167311 states and 524219 transitions. [2018-11-28 11:18:57,521 INFO L78 Accepts]: Start accepts. Automaton has 167311 states and 524219 transitions. Word has length 82 [2018-11-28 11:18:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:57,521 INFO L480 AbstractCegarLoop]: Abstraction has 167311 states and 524219 transitions. [2018-11-28 11:18:57,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:18:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 167311 states and 524219 transitions. [2018-11-28 11:18:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 11:18:57,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:18:57,569 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] [2018-11-28 11:18:57,569 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:18:57,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:18:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash -56565919, now seen corresponding path program 1 times [2018-11-28 11:18:57,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:18:57,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:18:57,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:57,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:18:57,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:18:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:18:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:18:57,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:18:57,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:18:57,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:18:57,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:18:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:18:57,636 INFO L87 Difference]: Start difference. First operand 167311 states and 524219 transitions. Second operand 4 states. [2018-11-28 11:18:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:58,808 INFO L93 Difference]: Finished difference Result 233999 states and 731439 transitions. [2018-11-28 11:18:58,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:18:58,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-28 11:18:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:59,215 INFO L225 Difference]: With dead ends: 233999 [2018-11-28 11:18:59,216 INFO L226 Difference]: Without dead ends: 233767 [2018-11-28 11:18:59,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-28 11:18:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233767 states. [2018-11-28 11:19:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233767 to 204343. [2018-11-28 11:19:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204343 states. [2018-11-28 11:19:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204343 states to 204343 states and 641541 transitions. [2018-11-28 11:19:05,184 INFO L78 Accepts]: Start accepts. Automaton has 204343 states and 641541 transitions. Word has length 82 [2018-11-28 11:19:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:05,185 INFO L480 AbstractCegarLoop]: Abstraction has 204343 states and 641541 transitions. [2018-11-28 11:19:05,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:19:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 204343 states and 641541 transitions. [2018-11-28 11:19:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 11:19:05,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:05,253 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] [2018-11-28 11:19:05,253 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:05,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:05,254 INFO L82 PathProgramCache]: Analyzing trace with hash 905048098, now seen corresponding path program 1 times [2018-11-28 11:19:05,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:05,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:05,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:05,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:05,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:05,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:05,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:19:05,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:19:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:19:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:19:05,330 INFO L87 Difference]: Start difference. First operand 204343 states and 641541 transitions. Second operand 5 states. [2018-11-28 11:19:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:06,348 INFO L93 Difference]: Finished difference Result 219711 states and 678043 transitions. [2018-11-28 11:19:06,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:19:06,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-28 11:19:06,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:06,725 INFO L225 Difference]: With dead ends: 219711 [2018-11-28 11:19:06,725 INFO L226 Difference]: Without dead ends: 219535 [2018-11-28 11:19:06,725 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-11-28 11:19:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219535 states. [2018-11-28 11:19:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219535 to 181816. [2018-11-28 11:19:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181816 states. [2018-11-28 11:19:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181816 states to 181816 states and 565629 transitions. [2018-11-28 11:19:09,750 INFO L78 Accepts]: Start accepts. Automaton has 181816 states and 565629 transitions. Word has length 82 [2018-11-28 11:19:09,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:09,750 INFO L480 AbstractCegarLoop]: Abstraction has 181816 states and 565629 transitions. [2018-11-28 11:19:09,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:19:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 181816 states and 565629 transitions. [2018-11-28 11:19:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 11:19:09,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:09,795 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] [2018-11-28 11:19:09,795 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:09,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2145154717, now seen corresponding path program 1 times [2018-11-28 11:19:09,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:09,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:09,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:09,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:09,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:19:09,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:19:09,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:19:09,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:19:09,846 INFO L87 Difference]: Start difference. First operand 181816 states and 565629 transitions. Second operand 5 states. [2018-11-28 11:19:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:09,900 INFO L93 Difference]: Finished difference Result 18256 states and 44415 transitions. [2018-11-28 11:19:09,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:19:09,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-28 11:19:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:09,912 INFO L225 Difference]: With dead ends: 18256 [2018-11-28 11:19:09,912 INFO L226 Difference]: Without dead ends: 15627 [2018-11-28 11:19:09,913 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-11-28 11:19:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15627 states. [2018-11-28 11:19:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15627 to 14310. [2018-11-28 11:19:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14310 states. [2018-11-28 11:19:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14310 states to 14310 states and 33903 transitions. [2018-11-28 11:19:10,043 INFO L78 Accepts]: Start accepts. Automaton has 14310 states and 33903 transitions. Word has length 82 [2018-11-28 11:19:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:10,043 INFO L480 AbstractCegarLoop]: Abstraction has 14310 states and 33903 transitions. [2018-11-28 11:19:10,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:19:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 14310 states and 33903 transitions. [2018-11-28 11:19:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 11:19:10,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:10,053 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] [2018-11-28 11:19:10,053 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:10,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1849176376, now seen corresponding path program 1 times [2018-11-28 11:19:10,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:10,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:10,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:10,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:10,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:19:10,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:19:10,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:19:10,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:19:10,119 INFO L87 Difference]: Start difference. First operand 14310 states and 33903 transitions. Second operand 6 states. [2018-11-28 11:19:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:10,308 INFO L93 Difference]: Finished difference Result 18366 states and 43448 transitions. [2018-11-28 11:19:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:19:10,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-11-28 11:19:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:10,321 INFO L225 Difference]: With dead ends: 18366 [2018-11-28 11:19:10,322 INFO L226 Difference]: Without dead ends: 18366 [2018-11-28 11:19:10,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:19:10,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18366 states. [2018-11-28 11:19:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18366 to 16694. [2018-11-28 11:19:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16694 states. [2018-11-28 11:19:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16694 states to 16694 states and 39650 transitions. [2018-11-28 11:19:10,814 INFO L78 Accepts]: Start accepts. Automaton has 16694 states and 39650 transitions. Word has length 88 [2018-11-28 11:19:10,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:10,814 INFO L480 AbstractCegarLoop]: Abstraction has 16694 states and 39650 transitions. [2018-11-28 11:19:10,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:19:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 16694 states and 39650 transitions. [2018-11-28 11:19:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 11:19:10,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:10,824 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] [2018-11-28 11:19:10,824 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:10,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:10,824 INFO L82 PathProgramCache]: Analyzing trace with hash -106366041, now seen corresponding path program 1 times [2018-11-28 11:19:10,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:10,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:10,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:10,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:10,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:19:10,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:19:10,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:19:10,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:19:10,965 INFO L87 Difference]: Start difference. First operand 16694 states and 39650 transitions. Second operand 10 states. [2018-11-28 11:19:11,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:11,897 INFO L93 Difference]: Finished difference Result 20494 states and 48001 transitions. [2018-11-28 11:19:11,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:19:11,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-11-28 11:19:11,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:11,915 INFO L225 Difference]: With dead ends: 20494 [2018-11-28 11:19:11,915 INFO L226 Difference]: Without dead ends: 20380 [2018-11-28 11:19:11,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2018-11-28 11:19:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20380 states. [2018-11-28 11:19:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20380 to 17809. [2018-11-28 11:19:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17809 states. [2018-11-28 11:19:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17809 states to 17809 states and 42023 transitions. [2018-11-28 11:19:12,092 INFO L78 Accepts]: Start accepts. Automaton has 17809 states and 42023 transitions. Word has length 88 [2018-11-28 11:19:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:12,093 INFO L480 AbstractCegarLoop]: Abstraction has 17809 states and 42023 transitions. [2018-11-28 11:19:12,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:19:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 17809 states and 42023 transitions. [2018-11-28 11:19:12,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 11:19:12,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:12,106 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] [2018-11-28 11:19:12,106 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:12,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:12,106 INFO L82 PathProgramCache]: Analyzing trace with hash -594830456, now seen corresponding path program 1 times [2018-11-28 11:19:12,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:12,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:12,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:12,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:12,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:12,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:12,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:19:12,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:19:12,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:19:12,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:19:12,165 INFO L87 Difference]: Start difference. First operand 17809 states and 42023 transitions. Second operand 6 states. [2018-11-28 11:19:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:12,348 INFO L93 Difference]: Finished difference Result 22682 states and 53302 transitions. [2018-11-28 11:19:12,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:19:12,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-11-28 11:19:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:12,368 INFO L225 Difference]: With dead ends: 22682 [2018-11-28 11:19:12,369 INFO L226 Difference]: Without dead ends: 22682 [2018-11-28 11:19:12,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:19:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22682 states. [2018-11-28 11:19:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22682 to 17804. [2018-11-28 11:19:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17804 states. [2018-11-28 11:19:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17804 states to 17804 states and 42001 transitions. [2018-11-28 11:19:12,556 INFO L78 Accepts]: Start accepts. Automaton has 17804 states and 42001 transitions. Word has length 88 [2018-11-28 11:19:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:12,556 INFO L480 AbstractCegarLoop]: Abstraction has 17804 states and 42001 transitions. [2018-11-28 11:19:12,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:19:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 17804 states and 42001 transitions. [2018-11-28 11:19:12,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 11:19:12,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:12,569 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] [2018-11-28 11:19:12,569 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:12,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:12,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1147979879, now seen corresponding path program 1 times [2018-11-28 11:19:12,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:12,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:12,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:12,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:12,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:12,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:12,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:19:12,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:19:12,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:19:12,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:19:12,687 INFO L87 Difference]: Start difference. First operand 17804 states and 42001 transitions. Second operand 10 states. [2018-11-28 11:19:13,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:13,607 INFO L93 Difference]: Finished difference Result 20835 states and 48650 transitions. [2018-11-28 11:19:13,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 11:19:13,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-11-28 11:19:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:13,625 INFO L225 Difference]: With dead ends: 20835 [2018-11-28 11:19:13,625 INFO L226 Difference]: Without dead ends: 20749 [2018-11-28 11:19:13,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-11-28 11:19:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20749 states. [2018-11-28 11:19:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20749 to 17590. [2018-11-28 11:19:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17590 states. [2018-11-28 11:19:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17590 states to 17590 states and 41562 transitions. [2018-11-28 11:19:13,804 INFO L78 Accepts]: Start accepts. Automaton has 17590 states and 41562 transitions. Word has length 88 [2018-11-28 11:19:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:13,804 INFO L480 AbstractCegarLoop]: Abstraction has 17590 states and 41562 transitions. [2018-11-28 11:19:13,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:19:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 17590 states and 41562 transitions. [2018-11-28 11:19:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 11:19:13,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:13,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:13,817 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:13,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:13,818 INFO L82 PathProgramCache]: Analyzing trace with hash -968928213, now seen corresponding path program 1 times [2018-11-28 11:19:13,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:13,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:13,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:13,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:13,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:13,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:13,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:19:13,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:19:13,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:19:13,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:19:13,920 INFO L87 Difference]: Start difference. First operand 17590 states and 41562 transitions. Second operand 7 states. [2018-11-28 11:19:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:14,244 INFO L93 Difference]: Finished difference Result 22434 states and 52977 transitions. [2018-11-28 11:19:14,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:19:14,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-11-28 11:19:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:14,264 INFO L225 Difference]: With dead ends: 22434 [2018-11-28 11:19:14,264 INFO L226 Difference]: Without dead ends: 22434 [2018-11-28 11:19:14,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:19:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2018-11-28 11:19:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 18153. [2018-11-28 11:19:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18153 states. [2018-11-28 11:19:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18153 states to 18153 states and 42901 transitions. [2018-11-28 11:19:14,449 INFO L78 Accepts]: Start accepts. Automaton has 18153 states and 42901 transitions. Word has length 100 [2018-11-28 11:19:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:14,449 INFO L480 AbstractCegarLoop]: Abstraction has 18153 states and 42901 transitions. [2018-11-28 11:19:14,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:19:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 18153 states and 42901 transitions. [2018-11-28 11:19:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 11:19:14,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:14,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:14,464 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:14,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:14,464 INFO L82 PathProgramCache]: Analyzing trace with hash 773882122, now seen corresponding path program 1 times [2018-11-28 11:19:14,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:14,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:14,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:14,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:14,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:14,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:14,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:19:14,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:19:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:19:14,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:19:14,571 INFO L87 Difference]: Start difference. First operand 18153 states and 42901 transitions. Second operand 11 states. [2018-11-28 11:19:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:15,533 INFO L93 Difference]: Finished difference Result 21139 states and 49475 transitions. [2018-11-28 11:19:15,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 11:19:15,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-11-28 11:19:15,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:15,551 INFO L225 Difference]: With dead ends: 21139 [2018-11-28 11:19:15,551 INFO L226 Difference]: Without dead ends: 21009 [2018-11-28 11:19:15,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 11:19:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21009 states. [2018-11-28 11:19:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21009 to 16774. [2018-11-28 11:19:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16774 states. [2018-11-28 11:19:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16774 states to 16774 states and 39914 transitions. [2018-11-28 11:19:15,828 INFO L78 Accepts]: Start accepts. Automaton has 16774 states and 39914 transitions. Word has length 100 [2018-11-28 11:19:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:15,828 INFO L480 AbstractCegarLoop]: Abstraction has 16774 states and 39914 transitions. [2018-11-28 11:19:15,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:19:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 16774 states and 39914 transitions. [2018-11-28 11:19:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-28 11:19:15,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:15,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:15,841 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:15,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash -906257866, now seen corresponding path program 1 times [2018-11-28 11:19:15,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:15,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:15,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:15,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:15,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:15,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:15,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:19:15,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:19:15,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:19:15,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:19:15,921 INFO L87 Difference]: Start difference. First operand 16774 states and 39914 transitions. Second operand 7 states. [2018-11-28 11:19:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:16,514 INFO L93 Difference]: Finished difference Result 20448 states and 48334 transitions. [2018-11-28 11:19:16,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:19:16,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-11-28 11:19:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:16,529 INFO L225 Difference]: With dead ends: 20448 [2018-11-28 11:19:16,530 INFO L226 Difference]: Without dead ends: 20448 [2018-11-28 11:19:16,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:19:16,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20448 states. [2018-11-28 11:19:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20448 to 17150. [2018-11-28 11:19:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17150 states. [2018-11-28 11:19:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17150 states to 17150 states and 40983 transitions. [2018-11-28 11:19:16,697 INFO L78 Accepts]: Start accepts. Automaton has 17150 states and 40983 transitions. Word has length 125 [2018-11-28 11:19:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:16,697 INFO L480 AbstractCegarLoop]: Abstraction has 17150 states and 40983 transitions. [2018-11-28 11:19:16,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:19:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 17150 states and 40983 transitions. [2018-11-28 11:19:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-28 11:19:16,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:16,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:16,711 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:16,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:16,712 INFO L82 PathProgramCache]: Analyzing trace with hash 295243193, now seen corresponding path program 1 times [2018-11-28 11:19:16,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:16,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:16,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:16,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:16,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:16,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:16,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:19:16,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:19:16,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:19:16,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:19:16,770 INFO L87 Difference]: Start difference. First operand 17150 states and 40983 transitions. Second operand 5 states. [2018-11-28 11:19:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:16,933 INFO L93 Difference]: Finished difference Result 26994 states and 63376 transitions. [2018-11-28 11:19:16,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:19:16,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2018-11-28 11:19:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:16,956 INFO L225 Difference]: With dead ends: 26994 [2018-11-28 11:19:16,956 INFO L226 Difference]: Without dead ends: 26994 [2018-11-28 11:19:16,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-11-28 11:19:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26994 states. [2018-11-28 11:19:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26994 to 24454. [2018-11-28 11:19:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24454 states. [2018-11-28 11:19:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24454 states to 24454 states and 57989 transitions. [2018-11-28 11:19:17,197 INFO L78 Accepts]: Start accepts. Automaton has 24454 states and 57989 transitions. Word has length 125 [2018-11-28 11:19:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:17,197 INFO L480 AbstractCegarLoop]: Abstraction has 24454 states and 57989 transitions. [2018-11-28 11:19:17,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:19:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 24454 states and 57989 transitions. [2018-11-28 11:19:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:17,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:17,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:17,218 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:17,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash 25931487, now seen corresponding path program 1 times [2018-11-28 11:19:17,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:17,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:17,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:17,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:17,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:17,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:17,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:19:17,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:19:17,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:19:17,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:19:17,275 INFO L87 Difference]: Start difference. First operand 24454 states and 57989 transitions. Second operand 6 states. [2018-11-28 11:19:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:17,460 INFO L93 Difference]: Finished difference Result 37692 states and 89177 transitions. [2018-11-28 11:19:17,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:19:17,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-28 11:19:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:17,493 INFO L225 Difference]: With dead ends: 37692 [2018-11-28 11:19:17,493 INFO L226 Difference]: Without dead ends: 37692 [2018-11-28 11:19:17,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:19:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37692 states. [2018-11-28 11:19:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37692 to 24305. [2018-11-28 11:19:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24305 states. [2018-11-28 11:19:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24305 states to 24305 states and 57756 transitions. [2018-11-28 11:19:17,773 INFO L78 Accepts]: Start accepts. Automaton has 24305 states and 57756 transitions. Word has length 127 [2018-11-28 11:19:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:17,773 INFO L480 AbstractCegarLoop]: Abstraction has 24305 states and 57756 transitions. [2018-11-28 11:19:17,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:19:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 24305 states and 57756 transitions. [2018-11-28 11:19:17,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:17,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:17,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:17,792 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:17,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:17,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1157415810, now seen corresponding path program 1 times [2018-11-28 11:19:17,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:17,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:17,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:17,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:17,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:17,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:17,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:19:17,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:19:17,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:19:17,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:19:17,848 INFO L87 Difference]: Start difference. First operand 24305 states and 57756 transitions. Second operand 4 states. [2018-11-28 11:19:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:18,112 INFO L93 Difference]: Finished difference Result 30698 states and 71631 transitions. [2018-11-28 11:19:18,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:19:18,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-28 11:19:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:18,138 INFO L225 Difference]: With dead ends: 30698 [2018-11-28 11:19:18,138 INFO L226 Difference]: Without dead ends: 30631 [2018-11-28 11:19:18,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-28 11:19:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30631 states. [2018-11-28 11:19:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30631 to 28665. [2018-11-28 11:19:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28665 states. [2018-11-28 11:19:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28665 states to 28665 states and 67379 transitions. [2018-11-28 11:19:18,417 INFO L78 Accepts]: Start accepts. Automaton has 28665 states and 67379 transitions. Word has length 127 [2018-11-28 11:19:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:18,417 INFO L480 AbstractCegarLoop]: Abstraction has 28665 states and 67379 transitions. [2018-11-28 11:19:18,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:19:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 28665 states and 67379 transitions. [2018-11-28 11:19:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:18,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:18,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:18,440 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:18,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1201891199, now seen corresponding path program 1 times [2018-11-28 11:19:18,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:18,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:18,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:19:18,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:19:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:19:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:19:18,583 INFO L87 Difference]: Start difference. First operand 28665 states and 67379 transitions. Second operand 11 states. [2018-11-28 11:19:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:20,145 INFO L93 Difference]: Finished difference Result 75448 states and 177106 transitions. [2018-11-28 11:19:20,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 11:19:20,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2018-11-28 11:19:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:20,188 INFO L225 Difference]: With dead ends: 75448 [2018-11-28 11:19:20,188 INFO L226 Difference]: Without dead ends: 57405 [2018-11-28 11:19:20,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2018-11-28 11:19:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57405 states. [2018-11-28 11:19:20,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57405 to 27910. [2018-11-28 11:19:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27910 states. [2018-11-28 11:19:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27910 states to 27910 states and 65707 transitions. [2018-11-28 11:19:20,564 INFO L78 Accepts]: Start accepts. Automaton has 27910 states and 65707 transitions. Word has length 127 [2018-11-28 11:19:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:20,564 INFO L480 AbstractCegarLoop]: Abstraction has 27910 states and 65707 transitions. [2018-11-28 11:19:20,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:19:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 27910 states and 65707 transitions. [2018-11-28 11:19:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:20,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:20,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:20,587 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:20,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash -60439278, now seen corresponding path program 1 times [2018-11-28 11:19:20,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:20,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:20,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:20,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:20,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:20,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:20,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:19:20,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:19:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:19:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:19:20,695 INFO L87 Difference]: Start difference. First operand 27910 states and 65707 transitions. Second operand 6 states. [2018-11-28 11:19:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:20,949 INFO L93 Difference]: Finished difference Result 30652 states and 71268 transitions. [2018-11-28 11:19:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:19:20,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-28 11:19:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:20,977 INFO L225 Difference]: With dead ends: 30652 [2018-11-28 11:19:20,977 INFO L226 Difference]: Without dead ends: 30610 [2018-11-28 11:19:20,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:19:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30610 states. [2018-11-28 11:19:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30610 to 27193. [2018-11-28 11:19:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27193 states. [2018-11-28 11:19:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27193 states to 27193 states and 63382 transitions. [2018-11-28 11:19:21,269 INFO L78 Accepts]: Start accepts. Automaton has 27193 states and 63382 transitions. Word has length 127 [2018-11-28 11:19:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:21,270 INFO L480 AbstractCegarLoop]: Abstraction has 27193 states and 63382 transitions. [2018-11-28 11:19:21,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:19:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 27193 states and 63382 transitions. [2018-11-28 11:19:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:21,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:21,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:21,294 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:21,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:21,295 INFO L82 PathProgramCache]: Analyzing trace with hash 577542988, now seen corresponding path program 1 times [2018-11-28 11:19:21,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:21,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:21,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:21,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:21,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:19:21,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:19:21,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:19:21,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:19:21,350 INFO L87 Difference]: Start difference. First operand 27193 states and 63382 transitions. Second operand 5 states. [2018-11-28 11:19:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:21,599 INFO L93 Difference]: Finished difference Result 28839 states and 66769 transitions. [2018-11-28 11:19:21,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:19:21,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-11-28 11:19:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:21,624 INFO L225 Difference]: With dead ends: 28839 [2018-11-28 11:19:21,624 INFO L226 Difference]: Without dead ends: 28839 [2018-11-28 11:19:21,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:19:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28839 states. [2018-11-28 11:19:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28839 to 27412. [2018-11-28 11:19:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27412 states. [2018-11-28 11:19:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27412 states to 27412 states and 63848 transitions. [2018-11-28 11:19:21,920 INFO L78 Accepts]: Start accepts. Automaton has 27412 states and 63848 transitions. Word has length 127 [2018-11-28 11:19:21,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:21,920 INFO L480 AbstractCegarLoop]: Abstraction has 27412 states and 63848 transitions. [2018-11-28 11:19:21,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:19:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand 27412 states and 63848 transitions. [2018-11-28 11:19:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:21,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:21,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:21,945 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:21,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:21,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1488351502, now seen corresponding path program 2 times [2018-11-28 11:19:21,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:21,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:21,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:22,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:22,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:19:22,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:19:22,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:19:22,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:19:22,030 INFO L87 Difference]: Start difference. First operand 27412 states and 63848 transitions. Second operand 6 states. [2018-11-28 11:19:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:22,301 INFO L93 Difference]: Finished difference Result 27526 states and 63909 transitions. [2018-11-28 11:19:22,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:19:22,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-28 11:19:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:22,326 INFO L225 Difference]: With dead ends: 27526 [2018-11-28 11:19:22,326 INFO L226 Difference]: Without dead ends: 27526 [2018-11-28 11:19:22,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:19:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27526 states. [2018-11-28 11:19:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27526 to 24870. [2018-11-28 11:19:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24870 states. [2018-11-28 11:19:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24870 states to 24870 states and 57768 transitions. [2018-11-28 11:19:22,579 INFO L78 Accepts]: Start accepts. Automaton has 24870 states and 57768 transitions. Word has length 127 [2018-11-28 11:19:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:22,580 INFO L480 AbstractCegarLoop]: Abstraction has 24870 states and 57768 transitions. [2018-11-28 11:19:22,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:19:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 24870 states and 57768 transitions. [2018-11-28 11:19:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:22,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:22,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:22,601 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:22,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash 893789617, now seen corresponding path program 2 times [2018-11-28 11:19:22,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:22,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:22,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:22,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:19:22,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:22,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:22,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:19:22,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:19:22,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:19:22,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:19:22,708 INFO L87 Difference]: Start difference. First operand 24870 states and 57768 transitions. Second operand 7 states. [2018-11-28 11:19:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:23,315 INFO L93 Difference]: Finished difference Result 39862 states and 92923 transitions. [2018-11-28 11:19:23,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:19:23,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-11-28 11:19:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:23,325 INFO L225 Difference]: With dead ends: 39862 [2018-11-28 11:19:23,325 INFO L226 Difference]: Without dead ends: 12503 [2018-11-28 11:19:23,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:19:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2018-11-28 11:19:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 12503. [2018-11-28 11:19:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12503 states. [2018-11-28 11:19:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12503 states to 12503 states and 29534 transitions. [2018-11-28 11:19:23,438 INFO L78 Accepts]: Start accepts. Automaton has 12503 states and 29534 transitions. Word has length 127 [2018-11-28 11:19:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:23,438 INFO L480 AbstractCegarLoop]: Abstraction has 12503 states and 29534 transitions. [2018-11-28 11:19:23,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:19:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 12503 states and 29534 transitions. [2018-11-28 11:19:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:23,448 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:23,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:23,449 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:23,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash 528390363, now seen corresponding path program 3 times [2018-11-28 11:19:23,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:23,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:23,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:19:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:23,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:23,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-28 11:19:23,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 11:19:23,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 11:19:23,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:19:23,614 INFO L87 Difference]: Start difference. First operand 12503 states and 29534 transitions. Second operand 15 states. [2018-11-28 11:19:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:24,254 INFO L93 Difference]: Finished difference Result 27006 states and 64211 transitions. [2018-11-28 11:19:24,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 11:19:24,255 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2018-11-28 11:19:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:24,277 INFO L225 Difference]: With dead ends: 27006 [2018-11-28 11:19:24,277 INFO L226 Difference]: Without dead ends: 25346 [2018-11-28 11:19:24,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-11-28 11:19:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2018-11-28 11:19:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 20915. [2018-11-28 11:19:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20915 states. [2018-11-28 11:19:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20915 states to 20915 states and 49002 transitions. [2018-11-28 11:19:24,499 INFO L78 Accepts]: Start accepts. Automaton has 20915 states and 49002 transitions. Word has length 127 [2018-11-28 11:19:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:24,499 INFO L480 AbstractCegarLoop]: Abstraction has 20915 states and 49002 transitions. [2018-11-28 11:19:24,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 11:19:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 20915 states and 49002 transitions. [2018-11-28 11:19:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:24,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:24,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:24,515 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:24,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:24,515 INFO L82 PathProgramCache]: Analyzing trace with hash 520631004, now seen corresponding path program 1 times [2018-11-28 11:19:24,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:24,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:24,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:24,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:19:24,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:24,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:24,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:19:24,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:19:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:19:24,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:19:24,594 INFO L87 Difference]: Start difference. First operand 20915 states and 49002 transitions. Second operand 5 states. [2018-11-28 11:19:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:24,702 INFO L93 Difference]: Finished difference Result 17074 states and 39845 transitions. [2018-11-28 11:19:24,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:19:24,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-11-28 11:19:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:24,717 INFO L225 Difference]: With dead ends: 17074 [2018-11-28 11:19:24,717 INFO L226 Difference]: Without dead ends: 17074 [2018-11-28 11:19:24,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:19:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17074 states. [2018-11-28 11:19:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17074 to 16940. [2018-11-28 11:19:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16940 states. [2018-11-28 11:19:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16940 states to 16940 states and 39561 transitions. [2018-11-28 11:19:24,877 INFO L78 Accepts]: Start accepts. Automaton has 16940 states and 39561 transitions. Word has length 127 [2018-11-28 11:19:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:24,877 INFO L480 AbstractCegarLoop]: Abstraction has 16940 states and 39561 transitions. [2018-11-28 11:19:24,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:19:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16940 states and 39561 transitions. [2018-11-28 11:19:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:24,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:24,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:24,892 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:24,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash -42610214, now seen corresponding path program 2 times [2018-11-28 11:19:24,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:24,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:24,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:24,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:24,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:19:24,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:19:24,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:19:24,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:19:24,989 INFO L87 Difference]: Start difference. First operand 16940 states and 39561 transitions. Second operand 8 states. [2018-11-28 11:19:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:25,447 INFO L93 Difference]: Finished difference Result 19482 states and 45243 transitions. [2018-11-28 11:19:25,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:19:25,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-11-28 11:19:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:25,465 INFO L225 Difference]: With dead ends: 19482 [2018-11-28 11:19:25,465 INFO L226 Difference]: Without dead ends: 19482 [2018-11-28 11:19:25,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:19:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19482 states. [2018-11-28 11:19:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19482 to 18409. [2018-11-28 11:19:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18409 states. [2018-11-28 11:19:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18409 states to 18409 states and 42940 transitions. [2018-11-28 11:19:25,644 INFO L78 Accepts]: Start accepts. Automaton has 18409 states and 42940 transitions. Word has length 127 [2018-11-28 11:19:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:25,644 INFO L480 AbstractCegarLoop]: Abstraction has 18409 states and 42940 transitions. [2018-11-28 11:19:25,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:19:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 18409 states and 42940 transitions. [2018-11-28 11:19:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 11:19:25,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:25,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:25,660 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:25,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:25,660 INFO L82 PathProgramCache]: Analyzing trace with hash 45331485, now seen corresponding path program 4 times [2018-11-28 11:19:25,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:25,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:25,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:25,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:19:25,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:19:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:19:25,725 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:19:25,846 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 11:19:25,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:19:25 BasicIcfg [2018-11-28 11:19:25,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:19:25,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:19:25,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:19:25,848 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:19:25,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:44" (3/4) ... [2018-11-28 11:19:25,851 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:19:25,970 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1112afb3-4dfc-4381-86f8-b712f28c386b/bin-2019/uautomizer/witness.graphml [2018-11-28 11:19:25,970 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:19:25,971 INFO L168 Benchmark]: Toolchain (without parser) took 102613.01 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.9 GB). Free memory was 950.6 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-11-28 11:19:25,972 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:19:25,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:25,973 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:25,976 INFO L168 Benchmark]: Boogie Preprocessor took 34.28 ms. Allocated memory is still 1.2 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-11-28 11:19:25,976 INFO L168 Benchmark]: RCFGBuilder took 684.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.1 MB). Peak memory consumption was 67.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:25,977 INFO L168 Benchmark]: TraceAbstraction took 101279.99 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-11-28 11:19:25,977 INFO L168 Benchmark]: Witness Printer took 122.52 ms. Allocated memory is still 5.9 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 79.5 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:25,979 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 442.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.28 ms. Allocated memory is still 1.2 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. * RCFGBuilder took 684.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.1 MB). Peak memory consumption was 67.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 101279.99 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 122.52 ms. Allocated memory is still 5.9 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 79.5 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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 t1591; VAL [__unbuffered_cnt=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(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 2 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 pthread_t t1592; VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK -1 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 2 [L732] 1 y = 1 [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !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 [!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)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 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) [L740] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 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)) [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 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)) [L742] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 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)) [L743] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 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)) [L744] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 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)) [L745] EXPR 1 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 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)) [L746] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 [L751] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L752] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L753] 1 y$flush_delayed = weak$$choice2 [L754] 1 y$mem_tmp = y VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] EXPR 1 !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 [!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)=1, __unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 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) [L756] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 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)) [L757] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 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)) [L758] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 1 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)) [L759] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 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)) [L760] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 1 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)) [L761] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 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)) [L762] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 y = y$flush_delayed ? y$mem_tmp : y [L764] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1] [L767] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1] [L767] 1 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 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 1 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 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 1 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 1 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] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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 weak$$choice0 = __VERIFIER_nondet_pointer() [L806] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L807] -1 y$flush_delayed = weak$$choice2 [L808] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] -1 y = y$flush_delayed ? y$mem_tmp : y [L818] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 348 locations, 3 error locations. UNSAFE Result, 101.1s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 34.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22493 SDtfs, 23055 SDslu, 68349 SDs, 0 SdLazy, 28111 SolverSat, 1035 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 556 GetRequests, 126 SyntacticMatches, 29 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204343occurred in iteration=18, 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: 47.9s AutomataMinimizationTime, 38 MinimizatonAttempts, 529726 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3593 NumberOfCodeBlocks, 3593 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3428 ConstructedInterpolants, 0 QuantifiedInterpolants, 810820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...