./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/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 afbf25d75f484a934aa8912c08ac22e74061fce8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 03:06:00,865 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:06:00,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:06:00,872 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:06:00,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:06:00,873 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:06:00,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:06:00,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:06:00,875 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:06:00,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:06:00,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:06:00,876 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:06:00,877 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:06:00,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:06:00,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:06:00,878 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:06:00,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:06:00,879 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:06:00,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:06:00,881 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:06:00,882 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:06:00,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:06:00,884 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:06:00,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:06:00,884 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:06:00,884 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:06:00,885 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:06:00,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:06:00,886 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:06:00,887 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:06:00,887 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:06:00,887 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:06:00,887 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:06:00,887 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:06:00,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:06:00,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:06:00,888 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 03:06:00,896 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:06:00,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:06:00,896 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:06:00,897 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:06:00,897 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:06:00,897 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:06:00,897 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 03:06:00,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:06:00,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:06:00,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:06:00,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:06:00,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:06:00,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 03:06:00,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:06:00,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 03:06:00,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:06:00,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:06:00,898 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 03:06:00,898 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 03:06:00,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:06:00,898 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:06:00,898 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:06:00,898 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:06:00,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:06:00,899 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:06:00,899 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:06:00,899 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 03:06:00,899 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 03:06:00,899 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:06:00,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 03:06:00,899 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_05ee3597-765f-4715-837e-791981eee786/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 -> afbf25d75f484a934aa8912c08ac22e74061fce8 [2018-12-02 03:06:00,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:06:00,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:06:00,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:06:00,926 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:06:00,926 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:06:00,926 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i [2018-12-02 03:06:00,959 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/data/324b86513/0a6c9e4826984adf9f21d5251d341829/FLAGd98c8c997 [2018-12-02 03:06:01,349 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:06:01,349 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i [2018-12-02 03:06:01,356 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/data/324b86513/0a6c9e4826984adf9f21d5251d341829/FLAGd98c8c997 [2018-12-02 03:06:01,694 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/data/324b86513/0a6c9e4826984adf9f21d5251d341829 [2018-12-02 03:06:01,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:06:01,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:06:01,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:06:01,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:06:01,701 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:06:01,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:06:01" (1/1) ... [2018-12-02 03:06:01,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340b48b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:01, skipping insertion in model container [2018-12-02 03:06:01,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:06:01" (1/1) ... [2018-12-02 03:06:01,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:06:01,730 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:06:01,904 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:06:01,912 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:06:02,005 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:06:02,039 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:06:02,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02 WrapperNode [2018-12-02 03:06:02,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:06:02,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:06:02,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:06:02,040 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:06:02,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (1/1) ... [2018-12-02 03:06:02,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (1/1) ... [2018-12-02 03:06:02,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:06:02,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:06:02,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:06:02,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:06:02,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (1/1) ... [2018-12-02 03:06:02,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (1/1) ... [2018-12-02 03:06:02,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (1/1) ... [2018-12-02 03:06:02,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (1/1) ... [2018-12-02 03:06:02,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (1/1) ... [2018-12-02 03:06:02,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (1/1) ... [2018-12-02 03:06:02,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (1/1) ... [2018-12-02 03:06:02,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:06:02,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:06:02,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:06:02,099 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:06:02,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:06:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:06:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:06:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 03:06:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:06:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 03:06:02,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 03:06:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 03:06:02,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 03:06:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 03:06:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:06:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:06:02,131 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 03:06:02,422 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:06:02,422 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 03:06:02,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:06:02 BoogieIcfgContainer [2018-12-02 03:06:02,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:06:02,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:06:02,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:06:02,425 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:06:02,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:06:01" (1/3) ... [2018-12-02 03:06:02,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c26ac1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:06:02, skipping insertion in model container [2018-12-02 03:06:02,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:06:02" (2/3) ... [2018-12-02 03:06:02,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c26ac1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:06:02, skipping insertion in model container [2018-12-02 03:06:02,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:06:02" (3/3) ... [2018-12-02 03:06:02,428 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.opt_false-unreach-call.i [2018-12-02 03:06:02,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,452 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,452 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,452 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,452 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,452 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,452 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,458 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,458 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:06:02,481 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 03:06:02,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:06:02,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 03:06:02,499 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 03:06:02,516 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 03:06:02,516 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:06:02,516 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 03:06:02,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:06:02,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:06:02,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:06:02,517 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:06:02,517 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:06:02,517 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:06:02,525 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-02 03:06:04,019 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34805 states. [2018-12-02 03:06:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 34805 states. [2018-12-02 03:06:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 03:06:04,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:04,025 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] [2018-12-02 03:06:04,027 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:04,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:04,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1272153477, now seen corresponding path program 1 times [2018-12-02 03:06:04,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:04,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:04,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:04,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:04,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:06:04,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:06:04,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:06:04,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:06:04,191 INFO L87 Difference]: Start difference. First operand 34805 states. Second operand 4 states. [2018-12-02 03:06:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:04,708 INFO L93 Difference]: Finished difference Result 60789 states and 234492 transitions. [2018-12-02 03:06:04,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:06:04,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-02 03:06:04,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:04,862 INFO L225 Difference]: With dead ends: 60789 [2018-12-02 03:06:04,862 INFO L226 Difference]: Without dead ends: 44269 [2018-12-02 03:06:04,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:06:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44269 states. [2018-12-02 03:06:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44269 to 27337. [2018-12-02 03:06:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27337 states. [2018-12-02 03:06:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27337 states to 27337 states and 105498 transitions. [2018-12-02 03:06:05,618 INFO L78 Accepts]: Start accepts. Automaton has 27337 states and 105498 transitions. Word has length 32 [2018-12-02 03:06:05,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:05,618 INFO L480 AbstractCegarLoop]: Abstraction has 27337 states and 105498 transitions. [2018-12-02 03:06:05,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:06:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27337 states and 105498 transitions. [2018-12-02 03:06:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 03:06:05,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:05,623 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] [2018-12-02 03:06:05,623 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:05,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:05,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1559910934, now seen corresponding path program 1 times [2018-12-02 03:06:05,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:05,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:05,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:05,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:05,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:05,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:05,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:06:05,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:06:05,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:06:05,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:06:05,676 INFO L87 Difference]: Start difference. First operand 27337 states and 105498 transitions. Second operand 4 states. [2018-12-02 03:06:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:05,747 INFO L93 Difference]: Finished difference Result 8527 states and 28343 transitions. [2018-12-02 03:06:05,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:06:05,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-02 03:06:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:05,761 INFO L225 Difference]: With dead ends: 8527 [2018-12-02 03:06:05,761 INFO L226 Difference]: Without dead ends: 7465 [2018-12-02 03:06:05,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2018-12-02 03:06:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 7465. [2018-12-02 03:06:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7465 states. [2018-12-02 03:06:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 24635 transitions. [2018-12-02 03:06:05,854 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 24635 transitions. Word has length 44 [2018-12-02 03:06:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:05,855 INFO L480 AbstractCegarLoop]: Abstraction has 7465 states and 24635 transitions. [2018-12-02 03:06:05,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:06:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 24635 transitions. [2018-12-02 03:06:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 03:06:05,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:05,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:06:05,856 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:05,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:05,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1459656693, now seen corresponding path program 1 times [2018-12-02 03:06:05,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:05,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:05,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:05,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:05,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:05,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:06:05,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:06:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:06:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:05,912 INFO L87 Difference]: Start difference. First operand 7465 states and 24635 transitions. Second operand 5 states. [2018-12-02 03:06:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:06,119 INFO L93 Difference]: Finished difference Result 13997 states and 45804 transitions. [2018-12-02 03:06:06,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:06:06,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 03:06:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:06,138 INFO L225 Difference]: With dead ends: 13997 [2018-12-02 03:06:06,138 INFO L226 Difference]: Without dead ends: 13929 [2018-12-02 03:06:06,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:06:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13929 states. [2018-12-02 03:06:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13929 to 9440. [2018-12-02 03:06:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9440 states. [2018-12-02 03:06:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9440 states to 9440 states and 30541 transitions. [2018-12-02 03:06:06,282 INFO L78 Accepts]: Start accepts. Automaton has 9440 states and 30541 transitions. Word has length 45 [2018-12-02 03:06:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:06,283 INFO L480 AbstractCegarLoop]: Abstraction has 9440 states and 30541 transitions. [2018-12-02 03:06:06,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:06:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 9440 states and 30541 transitions. [2018-12-02 03:06:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 03:06:06,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:06,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:06:06,284 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:06,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:06,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1598559727, now seen corresponding path program 1 times [2018-12-02 03:06:06,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:06,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:06,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:06,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:06,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:06,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:06,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:06:06,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:06:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:06:06,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:06:06,312 INFO L87 Difference]: Start difference. First operand 9440 states and 30541 transitions. Second operand 3 states. [2018-12-02 03:06:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:06,376 INFO L93 Difference]: Finished difference Result 13278 states and 42640 transitions. [2018-12-02 03:06:06,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:06:06,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-02 03:06:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:06,455 INFO L225 Difference]: With dead ends: 13278 [2018-12-02 03:06:06,456 INFO L226 Difference]: Without dead ends: 13278 [2018-12-02 03:06:06,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:06:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2018-12-02 03:06:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 9844. [2018-12-02 03:06:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9844 states. [2018-12-02 03:06:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9844 states to 9844 states and 31507 transitions. [2018-12-02 03:06:06,574 INFO L78 Accepts]: Start accepts. Automaton has 9844 states and 31507 transitions. Word has length 47 [2018-12-02 03:06:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:06,575 INFO L480 AbstractCegarLoop]: Abstraction has 9844 states and 31507 transitions. [2018-12-02 03:06:06,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:06:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 9844 states and 31507 transitions. [2018-12-02 03:06:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 03:06:06,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:06,576 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] [2018-12-02 03:06:06,576 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:06,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:06,576 INFO L82 PathProgramCache]: Analyzing trace with hash -108379620, now seen corresponding path program 1 times [2018-12-02 03:06:06,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:06,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:06,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:06,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:06,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:06:06,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:06:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:06:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:06:06,652 INFO L87 Difference]: Start difference. First operand 9844 states and 31507 transitions. Second operand 7 states. [2018-12-02 03:06:07,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:07,002 INFO L93 Difference]: Finished difference Result 12284 states and 38672 transitions. [2018-12-02 03:06:07,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 03:06:07,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-02 03:06:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:07,016 INFO L225 Difference]: With dead ends: 12284 [2018-12-02 03:06:07,017 INFO L226 Difference]: Without dead ends: 12212 [2018-12-02 03:06:07,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 03:06:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2018-12-02 03:06:07,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 10848. [2018-12-02 03:06:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10848 states. [2018-12-02 03:06:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10848 states to 10848 states and 34562 transitions. [2018-12-02 03:06:07,135 INFO L78 Accepts]: Start accepts. Automaton has 10848 states and 34562 transitions. Word has length 51 [2018-12-02 03:06:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:07,135 INFO L480 AbstractCegarLoop]: Abstraction has 10848 states and 34562 transitions. [2018-12-02 03:06:07,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:06:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10848 states and 34562 transitions. [2018-12-02 03:06:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 03:06:07,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:07,138 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] [2018-12-02 03:06:07,139 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:07,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:07,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1204429704, now seen corresponding path program 1 times [2018-12-02 03:06:07,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:07,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:07,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:07,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:07,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:07,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:07,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:06:07,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:06:07,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:06:07,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:06:07,179 INFO L87 Difference]: Start difference. First operand 10848 states and 34562 transitions. Second operand 4 states. [2018-12-02 03:06:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:07,256 INFO L93 Difference]: Finished difference Result 12395 states and 39571 transitions. [2018-12-02 03:06:07,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:06:07,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 03:06:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:07,270 INFO L225 Difference]: With dead ends: 12395 [2018-12-02 03:06:07,270 INFO L226 Difference]: Without dead ends: 12395 [2018-12-02 03:06:07,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:07,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12395 states. [2018-12-02 03:06:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12395 to 11368. [2018-12-02 03:06:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11368 states. [2018-12-02 03:06:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11368 states to 11368 states and 36235 transitions. [2018-12-02 03:06:07,391 INFO L78 Accepts]: Start accepts. Automaton has 11368 states and 36235 transitions. Word has length 59 [2018-12-02 03:06:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:07,391 INFO L480 AbstractCegarLoop]: Abstraction has 11368 states and 36235 transitions. [2018-12-02 03:06:07,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:06:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11368 states and 36235 transitions. [2018-12-02 03:06:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 03:06:07,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:07,397 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] [2018-12-02 03:06:07,397 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:07,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash 538380631, now seen corresponding path program 1 times [2018-12-02 03:06:07,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:07,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:07,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:07,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:07,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:07,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:07,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:06:07,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:06:07,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:06:07,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:06:07,459 INFO L87 Difference]: Start difference. First operand 11368 states and 36235 transitions. Second operand 6 states. [2018-12-02 03:06:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:07,764 INFO L93 Difference]: Finished difference Result 20968 states and 66485 transitions. [2018-12-02 03:06:07,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 03:06:07,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-02 03:06:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:07,792 INFO L225 Difference]: With dead ends: 20968 [2018-12-02 03:06:07,792 INFO L226 Difference]: Without dead ends: 20897 [2018-12-02 03:06:07,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:06:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20897 states. [2018-12-02 03:06:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20897 to 13754. [2018-12-02 03:06:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13754 states. [2018-12-02 03:06:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 43279 transitions. [2018-12-02 03:06:08,046 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 43279 transitions. Word has length 59 [2018-12-02 03:06:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:08,047 INFO L480 AbstractCegarLoop]: Abstraction has 13754 states and 43279 transitions. [2018-12-02 03:06:08,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:06:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 43279 transitions. [2018-12-02 03:06:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 03:06:08,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:08,051 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] [2018-12-02 03:06:08,051 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:08,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:08,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1986786434, now seen corresponding path program 1 times [2018-12-02 03:06:08,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:08,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:08,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:08,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:08,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:08,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:08,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:06:08,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:06:08,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:06:08,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:06:08,086 INFO L87 Difference]: Start difference. First operand 13754 states and 43279 transitions. Second operand 4 states. [2018-12-02 03:06:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:08,329 INFO L93 Difference]: Finished difference Result 20200 states and 61902 transitions. [2018-12-02 03:06:08,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:06:08,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 03:06:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:08,350 INFO L225 Difference]: With dead ends: 20200 [2018-12-02 03:06:08,351 INFO L226 Difference]: Without dead ends: 20200 [2018-12-02 03:06:08,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2018-12-02 03:06:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 15792. [2018-12-02 03:06:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2018-12-02 03:06:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 49060 transitions. [2018-12-02 03:06:08,528 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 49060 transitions. Word has length 63 [2018-12-02 03:06:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:08,529 INFO L480 AbstractCegarLoop]: Abstraction has 15792 states and 49060 transitions. [2018-12-02 03:06:08,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:06:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 49060 transitions. [2018-12-02 03:06:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 03:06:08,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:08,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] [2018-12-02 03:06:08,534 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:08,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:08,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1121709459, now seen corresponding path program 1 times [2018-12-02 03:06:08,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:08,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:08,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:08,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:08,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:08,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:08,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:06:08,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:06:08,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:06:08,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:06:08,580 INFO L87 Difference]: Start difference. First operand 15792 states and 49060 transitions. Second operand 4 states. [2018-12-02 03:06:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:08,761 INFO L93 Difference]: Finished difference Result 19959 states and 61084 transitions. [2018-12-02 03:06:08,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:06:08,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 03:06:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:08,782 INFO L225 Difference]: With dead ends: 19959 [2018-12-02 03:06:08,783 INFO L226 Difference]: Without dead ends: 19959 [2018-12-02 03:06:08,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:06:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19959 states. [2018-12-02 03:06:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19959 to 16086. [2018-12-02 03:06:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2018-12-02 03:06:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 49917 transitions. [2018-12-02 03:06:08,965 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 49917 transitions. Word has length 63 [2018-12-02 03:06:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:08,966 INFO L480 AbstractCegarLoop]: Abstraction has 16086 states and 49917 transitions. [2018-12-02 03:06:08,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:06:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 49917 transitions. [2018-12-02 03:06:08,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 03:06:08,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:08,972 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] [2018-12-02 03:06:08,972 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:08,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash 866972914, now seen corresponding path program 1 times [2018-12-02 03:06:08,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:08,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:08,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:08,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:08,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:08,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:08,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:06:08,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:06:08,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:06:08,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:06:08,997 INFO L87 Difference]: Start difference. First operand 16086 states and 49917 transitions. Second operand 3 states. [2018-12-02 03:06:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:09,130 INFO L93 Difference]: Finished difference Result 16558 states and 51205 transitions. [2018-12-02 03:06:09,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:06:09,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-02 03:06:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:09,148 INFO L225 Difference]: With dead ends: 16558 [2018-12-02 03:06:09,148 INFO L226 Difference]: Without dead ends: 16558 [2018-12-02 03:06:09,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:06:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16558 states. [2018-12-02 03:06:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16558 to 16322. [2018-12-02 03:06:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16322 states. [2018-12-02 03:06:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16322 states to 16322 states and 50541 transitions. [2018-12-02 03:06:09,367 INFO L78 Accepts]: Start accepts. Automaton has 16322 states and 50541 transitions. Word has length 63 [2018-12-02 03:06:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:09,367 INFO L480 AbstractCegarLoop]: Abstraction has 16322 states and 50541 transitions. [2018-12-02 03:06:09,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:06:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 16322 states and 50541 transitions. [2018-12-02 03:06:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 03:06:09,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:09,373 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] [2018-12-02 03:06:09,373 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:09,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1567726820, now seen corresponding path program 1 times [2018-12-02 03:06:09,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:09,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:09,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:09,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:09,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:06:09,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:06:09,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:06:09,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:06:09,451 INFO L87 Difference]: Start difference. First operand 16322 states and 50541 transitions. Second operand 6 states. [2018-12-02 03:06:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:09,697 INFO L93 Difference]: Finished difference Result 17646 states and 53545 transitions. [2018-12-02 03:06:09,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:06:09,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-02 03:06:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:09,715 INFO L225 Difference]: With dead ends: 17646 [2018-12-02 03:06:09,715 INFO L226 Difference]: Without dead ends: 17646 [2018-12-02 03:06:09,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:06:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17646 states. [2018-12-02 03:06:09,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17646 to 16546. [2018-12-02 03:06:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16546 states. [2018-12-02 03:06:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16546 states to 16546 states and 50764 transitions. [2018-12-02 03:06:09,885 INFO L78 Accepts]: Start accepts. Automaton has 16546 states and 50764 transitions. Word has length 65 [2018-12-02 03:06:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:09,885 INFO L480 AbstractCegarLoop]: Abstraction has 16546 states and 50764 transitions. [2018-12-02 03:06:09,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:06:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 16546 states and 50764 transitions. [2018-12-02 03:06:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 03:06:09,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:09,891 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] [2018-12-02 03:06:09,891 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:09,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1500720067, now seen corresponding path program 1 times [2018-12-02 03:06:09,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:09,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:09,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:09,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:06:09,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:06:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:06:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:09,936 INFO L87 Difference]: Start difference. First operand 16546 states and 50764 transitions. Second operand 5 states. [2018-12-02 03:06:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:10,179 INFO L93 Difference]: Finished difference Result 21334 states and 64873 transitions. [2018-12-02 03:06:10,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:06:10,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 03:06:10,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:10,202 INFO L225 Difference]: With dead ends: 21334 [2018-12-02 03:06:10,202 INFO L226 Difference]: Without dead ends: 21334 [2018-12-02 03:06:10,203 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-12-02 03:06:10,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21334 states. [2018-12-02 03:06:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21334 to 19570. [2018-12-02 03:06:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19570 states. [2018-12-02 03:06:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19570 states to 19570 states and 59494 transitions. [2018-12-02 03:06:10,407 INFO L78 Accepts]: Start accepts. Automaton has 19570 states and 59494 transitions. Word has length 65 [2018-12-02 03:06:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:10,407 INFO L480 AbstractCegarLoop]: Abstraction has 19570 states and 59494 transitions. [2018-12-02 03:06:10,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:06:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 19570 states and 59494 transitions. [2018-12-02 03:06:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 03:06:10,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:10,414 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] [2018-12-02 03:06:10,414 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:10,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:10,414 INFO L82 PathProgramCache]: Analyzing trace with hash 990185890, now seen corresponding path program 1 times [2018-12-02 03:06:10,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:10,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:10,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:10,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:10,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:10,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:10,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:06:10,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:06:10,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:06:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:10,466 INFO L87 Difference]: Start difference. First operand 19570 states and 59494 transitions. Second operand 5 states. [2018-12-02 03:06:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:10,764 INFO L93 Difference]: Finished difference Result 30156 states and 90237 transitions. [2018-12-02 03:06:10,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:06:10,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 03:06:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:10,798 INFO L225 Difference]: With dead ends: 30156 [2018-12-02 03:06:10,798 INFO L226 Difference]: Without dead ends: 30156 [2018-12-02 03:06:10,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:06:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2018-12-02 03:06:11,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 26760. [2018-12-02 03:06:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26760 states. [2018-12-02 03:06:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26760 states to 26760 states and 80370 transitions. [2018-12-02 03:06:11,141 INFO L78 Accepts]: Start accepts. Automaton has 26760 states and 80370 transitions. Word has length 65 [2018-12-02 03:06:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:11,141 INFO L480 AbstractCegarLoop]: Abstraction has 26760 states and 80370 transitions. [2018-12-02 03:06:11,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:06:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26760 states and 80370 transitions. [2018-12-02 03:06:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 03:06:11,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:11,151 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] [2018-12-02 03:06:11,152 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:11,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash -817268573, now seen corresponding path program 1 times [2018-12-02 03:06:11,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:11,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:11,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:11,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:11,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:11,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:06:11,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:06:11,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:06:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:06:11,279 INFO L87 Difference]: Start difference. First operand 26760 states and 80370 transitions. Second operand 4 states. [2018-12-02 03:06:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:11,640 INFO L93 Difference]: Finished difference Result 36608 states and 110252 transitions. [2018-12-02 03:06:11,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:06:11,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 03:06:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:11,682 INFO L225 Difference]: With dead ends: 36608 [2018-12-02 03:06:11,682 INFO L226 Difference]: Without dead ends: 36344 [2018-12-02 03:06:11,682 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-12-02 03:06:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36344 states. [2018-12-02 03:06:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36344 to 33704. [2018-12-02 03:06:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33704 states. [2018-12-02 03:06:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33704 states to 33704 states and 101614 transitions. [2018-12-02 03:06:12,054 INFO L78 Accepts]: Start accepts. Automaton has 33704 states and 101614 transitions. Word has length 65 [2018-12-02 03:06:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:12,054 INFO L480 AbstractCegarLoop]: Abstraction has 33704 states and 101614 transitions. [2018-12-02 03:06:12,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:06:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 33704 states and 101614 transitions. [2018-12-02 03:06:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 03:06:12,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:12,063 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] [2018-12-02 03:06:12,063 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:12,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:12,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1680747364, now seen corresponding path program 1 times [2018-12-02 03:06:12,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:12,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:12,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:12,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:12,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:12,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:12,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:06:12,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:06:12,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:06:12,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:12,092 INFO L87 Difference]: Start difference. First operand 33704 states and 101614 transitions. Second operand 5 states. [2018-12-02 03:06:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:12,123 INFO L93 Difference]: Finished difference Result 8356 states and 20403 transitions. [2018-12-02 03:06:12,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:06:12,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 03:06:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:12,128 INFO L225 Difference]: With dead ends: 8356 [2018-12-02 03:06:12,128 INFO L226 Difference]: Without dead ends: 6588 [2018-12-02 03:06:12,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:06:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2018-12-02 03:06:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 5161. [2018-12-02 03:06:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2018-12-02 03:06:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 12358 transitions. [2018-12-02 03:06:12,168 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 12358 transitions. Word has length 65 [2018-12-02 03:06:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:12,168 INFO L480 AbstractCegarLoop]: Abstraction has 5161 states and 12358 transitions. [2018-12-02 03:06:12,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:06:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 12358 transitions. [2018-12-02 03:06:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 03:06:12,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:12,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:06:12,171 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:12,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2026999384, now seen corresponding path program 1 times [2018-12-02 03:06:12,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:12,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:12,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:12,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:12,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:06:12,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:06:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:06:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:06:12,188 INFO L87 Difference]: Start difference. First operand 5161 states and 12358 transitions. Second operand 3 states. [2018-12-02 03:06:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:12,210 INFO L93 Difference]: Finished difference Result 7236 states and 17318 transitions. [2018-12-02 03:06:12,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:06:12,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-02 03:06:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:12,215 INFO L225 Difference]: With dead ends: 7236 [2018-12-02 03:06:12,215 INFO L226 Difference]: Without dead ends: 7236 [2018-12-02 03:06:12,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:06:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2018-12-02 03:06:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 5104. [2018-12-02 03:06:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2018-12-02 03:06:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 11991 transitions. [2018-12-02 03:06:12,255 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 11991 transitions. Word has length 65 [2018-12-02 03:06:12,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:12,255 INFO L480 AbstractCegarLoop]: Abstraction has 5104 states and 11991 transitions. [2018-12-02 03:06:12,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:06:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 11991 transitions. [2018-12-02 03:06:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 03:06:12,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:12,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:06:12,258 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:12,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:12,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1343049765, now seen corresponding path program 1 times [2018-12-02 03:06:12,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:12,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:12,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:12,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:12,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:12,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:12,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:06:12,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:06:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:06:12,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:12,299 INFO L87 Difference]: Start difference. First operand 5104 states and 11991 transitions. Second operand 5 states. [2018-12-02 03:06:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:12,389 INFO L93 Difference]: Finished difference Result 6127 states and 14344 transitions. [2018-12-02 03:06:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:06:12,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-02 03:06:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:12,393 INFO L225 Difference]: With dead ends: 6127 [2018-12-02 03:06:12,393 INFO L226 Difference]: Without dead ends: 6127 [2018-12-02 03:06:12,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:06:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2018-12-02 03:06:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5496. [2018-12-02 03:06:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5496 states. [2018-12-02 03:06:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 12892 transitions. [2018-12-02 03:06:12,431 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 12892 transitions. Word has length 71 [2018-12-02 03:06:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:12,431 INFO L480 AbstractCegarLoop]: Abstraction has 5496 states and 12892 transitions. [2018-12-02 03:06:12,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:06:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 12892 transitions. [2018-12-02 03:06:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 03:06:12,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:12,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:06:12,434 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:12,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash 399760570, now seen corresponding path program 1 times [2018-12-02 03:06:12,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:12,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:12,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:12,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:12,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 03:06:12,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 03:06:12,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 03:06:12,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:06:12,538 INFO L87 Difference]: Start difference. First operand 5496 states and 12892 transitions. Second operand 9 states. [2018-12-02 03:06:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:12,848 INFO L93 Difference]: Finished difference Result 7583 states and 17690 transitions. [2018-12-02 03:06:12,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 03:06:12,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-12-02 03:06:12,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:12,853 INFO L225 Difference]: With dead ends: 7583 [2018-12-02 03:06:12,853 INFO L226 Difference]: Without dead ends: 7528 [2018-12-02 03:06:12,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-02 03:06:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7528 states. [2018-12-02 03:06:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7528 to 5564. [2018-12-02 03:06:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5564 states. [2018-12-02 03:06:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 12958 transitions. [2018-12-02 03:06:12,899 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 12958 transitions. Word has length 71 [2018-12-02 03:06:12,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:12,900 INFO L480 AbstractCegarLoop]: Abstraction has 5564 states and 12958 transitions. [2018-12-02 03:06:12,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 03:06:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 12958 transitions. [2018-12-02 03:06:12,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 03:06:12,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:12,904 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] [2018-12-02 03:06:12,904 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:12,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:12,904 INFO L82 PathProgramCache]: Analyzing trace with hash -226879915, now seen corresponding path program 1 times [2018-12-02 03:06:12,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:12,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:12,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:12,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:12,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:12,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:12,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:06:12,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:06:12,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:06:12,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:06:12,933 INFO L87 Difference]: Start difference. First operand 5564 states and 12958 transitions. Second operand 3 states. [2018-12-02 03:06:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:13,033 INFO L93 Difference]: Finished difference Result 7293 states and 16480 transitions. [2018-12-02 03:06:13,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:06:13,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-02 03:06:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:13,038 INFO L225 Difference]: With dead ends: 7293 [2018-12-02 03:06:13,038 INFO L226 Difference]: Without dead ends: 6965 [2018-12-02 03:06:13,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:06:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2018-12-02 03:06:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6435. [2018-12-02 03:06:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6435 states. [2018-12-02 03:06:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 14760 transitions. [2018-12-02 03:06:13,084 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 14760 transitions. Word has length 90 [2018-12-02 03:06:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:13,084 INFO L480 AbstractCegarLoop]: Abstraction has 6435 states and 14760 transitions. [2018-12-02 03:06:13,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:06:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 14760 transitions. [2018-12-02 03:06:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 03:06:13,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:13,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:06:13,089 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:13,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash 871185909, now seen corresponding path program 1 times [2018-12-02 03:06:13,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:13,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:13,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:13,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:13,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:13,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:13,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:06:13,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:06:13,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:06:13,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:06:13,125 INFO L87 Difference]: Start difference. First operand 6435 states and 14760 transitions. Second operand 4 states. [2018-12-02 03:06:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:13,188 INFO L93 Difference]: Finished difference Result 6823 states and 15667 transitions. [2018-12-02 03:06:13,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:06:13,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-02 03:06:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:13,193 INFO L225 Difference]: With dead ends: 6823 [2018-12-02 03:06:13,193 INFO L226 Difference]: Without dead ends: 6823 [2018-12-02 03:06:13,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2018-12-02 03:06:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6359. [2018-12-02 03:06:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6359 states. [2018-12-02 03:06:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6359 states to 6359 states and 14673 transitions. [2018-12-02 03:06:13,239 INFO L78 Accepts]: Start accepts. Automaton has 6359 states and 14673 transitions. Word has length 90 [2018-12-02 03:06:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:13,239 INFO L480 AbstractCegarLoop]: Abstraction has 6359 states and 14673 transitions. [2018-12-02 03:06:13,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:06:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 6359 states and 14673 transitions. [2018-12-02 03:06:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:06:13,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:13,243 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] [2018-12-02 03:06:13,243 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:13,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:13,243 INFO L82 PathProgramCache]: Analyzing trace with hash -71232549, now seen corresponding path program 1 times [2018-12-02 03:06:13,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:13,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:13,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:13,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:13,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:06:13,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:06:13,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:06:13,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:13,293 INFO L87 Difference]: Start difference. First operand 6359 states and 14673 transitions. Second operand 5 states. [2018-12-02 03:06:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:13,361 INFO L93 Difference]: Finished difference Result 7324 states and 16774 transitions. [2018-12-02 03:06:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:06:13,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-02 03:06:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:13,366 INFO L225 Difference]: With dead ends: 7324 [2018-12-02 03:06:13,366 INFO L226 Difference]: Without dead ends: 7324 [2018-12-02 03:06:13,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:06:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2018-12-02 03:06:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 5724. [2018-12-02 03:06:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5724 states. [2018-12-02 03:06:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5724 states to 5724 states and 13218 transitions. [2018-12-02 03:06:13,411 INFO L78 Accepts]: Start accepts. Automaton has 5724 states and 13218 transitions. Word has length 92 [2018-12-02 03:06:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:13,411 INFO L480 AbstractCegarLoop]: Abstraction has 5724 states and 13218 transitions. [2018-12-02 03:06:13,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:06:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5724 states and 13218 transitions. [2018-12-02 03:06:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:06:13,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:13,415 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] [2018-12-02 03:06:13,416 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:13,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:13,416 INFO L82 PathProgramCache]: Analyzing trace with hash -325969094, now seen corresponding path program 1 times [2018-12-02 03:06:13,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:13,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:13,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:13,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:13,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:13,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:13,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:06:13,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:06:13,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:06:13,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:13,468 INFO L87 Difference]: Start difference. First operand 5724 states and 13218 transitions. Second operand 5 states. [2018-12-02 03:06:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:13,726 INFO L93 Difference]: Finished difference Result 9776 states and 22784 transitions. [2018-12-02 03:06:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:06:13,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-02 03:06:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:13,733 INFO L225 Difference]: With dead ends: 9776 [2018-12-02 03:06:13,733 INFO L226 Difference]: Without dead ends: 9760 [2018-12-02 03:06:13,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:06:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2018-12-02 03:06:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 6548. [2018-12-02 03:06:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2018-12-02 03:06:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 15152 transitions. [2018-12-02 03:06:13,789 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 15152 transitions. Word has length 92 [2018-12-02 03:06:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:13,790 INFO L480 AbstractCegarLoop]: Abstraction has 6548 states and 15152 transitions. [2018-12-02 03:06:13,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:06:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 15152 transitions. [2018-12-02 03:06:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:06:13,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:13,794 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] [2018-12-02 03:06:13,795 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:13,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash 918795387, now seen corresponding path program 1 times [2018-12-02 03:06:13,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:13,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:13,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:13,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:13,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:13,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:13,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:06:13,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:06:13,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:06:13,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:06:13,835 INFO L87 Difference]: Start difference. First operand 6548 states and 15152 transitions. Second operand 6 states. [2018-12-02 03:06:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:14,017 INFO L93 Difference]: Finished difference Result 8814 states and 20118 transitions. [2018-12-02 03:06:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 03:06:14,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-02 03:06:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:14,022 INFO L225 Difference]: With dead ends: 8814 [2018-12-02 03:06:14,022 INFO L226 Difference]: Without dead ends: 8814 [2018-12-02 03:06:14,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:06:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2018-12-02 03:06:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 6687. [2018-12-02 03:06:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6687 states. [2018-12-02 03:06:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 15343 transitions. [2018-12-02 03:06:14,076 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 15343 transitions. Word has length 92 [2018-12-02 03:06:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:14,076 INFO L480 AbstractCegarLoop]: Abstraction has 6687 states and 15343 transitions. [2018-12-02 03:06:14,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:06:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 15343 transitions. [2018-12-02 03:06:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:06:14,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:14,081 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] [2018-12-02 03:06:14,081 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:14,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:14,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2034234414, now seen corresponding path program 1 times [2018-12-02 03:06:14,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:14,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:14,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:14,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:14,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:14,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:14,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:06:14,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:06:14,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:06:14,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:06:14,158 INFO L87 Difference]: Start difference. First operand 6687 states and 15343 transitions. Second operand 7 states. [2018-12-02 03:06:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:14,339 INFO L93 Difference]: Finished difference Result 8708 states and 19628 transitions. [2018-12-02 03:06:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 03:06:14,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-02 03:06:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:14,345 INFO L225 Difference]: With dead ends: 8708 [2018-12-02 03:06:14,345 INFO L226 Difference]: Without dead ends: 8600 [2018-12-02 03:06:14,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:06:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8600 states. [2018-12-02 03:06:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8600 to 7161. [2018-12-02 03:06:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7161 states. [2018-12-02 03:06:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7161 states to 7161 states and 16336 transitions. [2018-12-02 03:06:14,399 INFO L78 Accepts]: Start accepts. Automaton has 7161 states and 16336 transitions. Word has length 92 [2018-12-02 03:06:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:14,400 INFO L480 AbstractCegarLoop]: Abstraction has 7161 states and 16336 transitions. [2018-12-02 03:06:14,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:06:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 7161 states and 16336 transitions. [2018-12-02 03:06:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:06:14,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:14,405 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] [2018-12-02 03:06:14,405 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:14,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash -42974929, now seen corresponding path program 1 times [2018-12-02 03:06:14,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:14,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:14,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:14,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:14,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 03:06:14,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 03:06:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 03:06:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:06:14,497 INFO L87 Difference]: Start difference. First operand 7161 states and 16336 transitions. Second operand 9 states. [2018-12-02 03:06:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:14,852 INFO L93 Difference]: Finished difference Result 10311 states and 23437 transitions. [2018-12-02 03:06:14,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 03:06:14,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2018-12-02 03:06:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:14,859 INFO L225 Difference]: With dead ends: 10311 [2018-12-02 03:06:14,859 INFO L226 Difference]: Without dead ends: 10279 [2018-12-02 03:06:14,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-02 03:06:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10279 states. [2018-12-02 03:06:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10279 to 8967. [2018-12-02 03:06:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8967 states. [2018-12-02 03:06:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8967 states to 8967 states and 20311 transitions. [2018-12-02 03:06:14,931 INFO L78 Accepts]: Start accepts. Automaton has 8967 states and 20311 transitions. Word has length 92 [2018-12-02 03:06:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:14,931 INFO L480 AbstractCegarLoop]: Abstraction has 8967 states and 20311 transitions. [2018-12-02 03:06:14,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 03:06:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 8967 states and 20311 transitions. [2018-12-02 03:06:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:06:14,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:14,938 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] [2018-12-02 03:06:14,938 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:14,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:14,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1839926288, now seen corresponding path program 1 times [2018-12-02 03:06:14,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:14,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:14,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:14,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:14,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:14,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:14,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 03:06:14,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 03:06:14,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:06:14,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:06:14,995 INFO L87 Difference]: Start difference. First operand 8967 states and 20311 transitions. Second operand 8 states. [2018-12-02 03:06:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:15,301 INFO L93 Difference]: Finished difference Result 13472 states and 31134 transitions. [2018-12-02 03:06:15,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 03:06:15,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-02 03:06:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:15,311 INFO L225 Difference]: With dead ends: 13472 [2018-12-02 03:06:15,311 INFO L226 Difference]: Without dead ends: 13472 [2018-12-02 03:06:15,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 03:06:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13472 states. [2018-12-02 03:06:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13472 to 9477. [2018-12-02 03:06:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9477 states. [2018-12-02 03:06:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9477 states to 9477 states and 21668 transitions. [2018-12-02 03:06:15,399 INFO L78 Accepts]: Start accepts. Automaton has 9477 states and 21668 transitions. Word has length 92 [2018-12-02 03:06:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:15,400 INFO L480 AbstractCegarLoop]: Abstraction has 9477 states and 21668 transitions. [2018-12-02 03:06:15,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 03:06:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 9477 states and 21668 transitions. [2018-12-02 03:06:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:06:15,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:15,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:06:15,406 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:15,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash -952422607, now seen corresponding path program 1 times [2018-12-02 03:06:15,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:15,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:15,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:15,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:15,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:15,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:15,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:06:15,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:06:15,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:06:15,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:06:15,463 INFO L87 Difference]: Start difference. First operand 9477 states and 21668 transitions. Second operand 6 states. [2018-12-02 03:06:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:15,511 INFO L93 Difference]: Finished difference Result 12003 states and 27498 transitions. [2018-12-02 03:06:15,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:06:15,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-02 03:06:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:15,521 INFO L225 Difference]: With dead ends: 12003 [2018-12-02 03:06:15,521 INFO L226 Difference]: Without dead ends: 12003 [2018-12-02 03:06:15,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:06:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12003 states. [2018-12-02 03:06:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12003 to 9739. [2018-12-02 03:06:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9739 states. [2018-12-02 03:06:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9739 states to 9739 states and 22123 transitions. [2018-12-02 03:06:15,598 INFO L78 Accepts]: Start accepts. Automaton has 9739 states and 22123 transitions. Word has length 92 [2018-12-02 03:06:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:15,599 INFO L480 AbstractCegarLoop]: Abstraction has 9739 states and 22123 transitions. [2018-12-02 03:06:15,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:06:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 22123 transitions. [2018-12-02 03:06:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:06:15,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:15,605 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] [2018-12-02 03:06:15,605 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:15,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1413054320, now seen corresponding path program 1 times [2018-12-02 03:06:15,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:15,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:15,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:15,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:15,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:15,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:06:15,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:06:15,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:06:15,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:06:15,668 INFO L87 Difference]: Start difference. First operand 9739 states and 22123 transitions. Second operand 7 states. [2018-12-02 03:06:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:15,791 INFO L93 Difference]: Finished difference Result 13063 states and 30000 transitions. [2018-12-02 03:06:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:06:15,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-02 03:06:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:15,804 INFO L225 Difference]: With dead ends: 13063 [2018-12-02 03:06:15,804 INFO L226 Difference]: Without dead ends: 13063 [2018-12-02 03:06:15,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:06:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13063 states. [2018-12-02 03:06:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13063 to 9137. [2018-12-02 03:06:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9137 states. [2018-12-02 03:06:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9137 states to 9137 states and 20655 transitions. [2018-12-02 03:06:15,896 INFO L78 Accepts]: Start accepts. Automaton has 9137 states and 20655 transitions. Word has length 92 [2018-12-02 03:06:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:15,896 INFO L480 AbstractCegarLoop]: Abstraction has 9137 states and 20655 transitions. [2018-12-02 03:06:15,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:06:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 9137 states and 20655 transitions. [2018-12-02 03:06:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 03:06:15,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:15,902 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] [2018-12-02 03:06:15,902 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:15,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash -318921232, now seen corresponding path program 1 times [2018-12-02 03:06:15,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:15,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:15,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:15,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:15,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:15,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:15,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:06:15,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:06:15,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:06:15,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:06:15,949 INFO L87 Difference]: Start difference. First operand 9137 states and 20655 transitions. Second operand 6 states. [2018-12-02 03:06:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:16,042 INFO L93 Difference]: Finished difference Result 8657 states and 19199 transitions. [2018-12-02 03:06:16,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:06:16,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-02 03:06:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:16,049 INFO L225 Difference]: With dead ends: 8657 [2018-12-02 03:06:16,049 INFO L226 Difference]: Without dead ends: 8657 [2018-12-02 03:06:16,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:06:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2018-12-02 03:06:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 5230. [2018-12-02 03:06:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5230 states. [2018-12-02 03:06:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 11603 transitions. [2018-12-02 03:06:16,116 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 11603 transitions. Word has length 92 [2018-12-02 03:06:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:16,117 INFO L480 AbstractCegarLoop]: Abstraction has 5230 states and 11603 transitions. [2018-12-02 03:06:16,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:06:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 11603 transitions. [2018-12-02 03:06:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 03:06:16,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:06:16,122 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:16,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash -34543133, now seen corresponding path program 1 times [2018-12-02 03:06:16,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:16,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:16,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:16,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:16,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 03:06:16,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 03:06:16,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 03:06:16,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-02 03:06:16,227 INFO L87 Difference]: Start difference. First operand 5230 states and 11603 transitions. Second operand 13 states. [2018-12-02 03:06:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:16,864 INFO L93 Difference]: Finished difference Result 7435 states and 16209 transitions. [2018-12-02 03:06:16,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 03:06:16,864 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-12-02 03:06:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:16,868 INFO L225 Difference]: With dead ends: 7435 [2018-12-02 03:06:16,868 INFO L226 Difference]: Without dead ends: 7435 [2018-12-02 03:06:16,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-02 03:06:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2018-12-02 03:06:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6126. [2018-12-02 03:06:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6126 states. [2018-12-02 03:06:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6126 states to 6126 states and 13501 transitions. [2018-12-02 03:06:16,918 INFO L78 Accepts]: Start accepts. Automaton has 6126 states and 13501 transitions. Word has length 94 [2018-12-02 03:06:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:16,918 INFO L480 AbstractCegarLoop]: Abstraction has 6126 states and 13501 transitions. [2018-12-02 03:06:16,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 03:06:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6126 states and 13501 transitions. [2018-12-02 03:06:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 03:06:16,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:16,924 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] [2018-12-02 03:06:16,924 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:16,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash 852960548, now seen corresponding path program 1 times [2018-12-02 03:06:16,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:16,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:16,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:16,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:16,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:17,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:17,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 03:06:17,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 03:06:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 03:06:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:06:17,024 INFO L87 Difference]: Start difference. First operand 6126 states and 13501 transitions. Second operand 11 states. [2018-12-02 03:06:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:17,799 INFO L93 Difference]: Finished difference Result 12214 states and 27167 transitions. [2018-12-02 03:06:17,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 03:06:17,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-12-02 03:06:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:17,804 INFO L225 Difference]: With dead ends: 12214 [2018-12-02 03:06:17,804 INFO L226 Difference]: Without dead ends: 8454 [2018-12-02 03:06:17,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 03:06:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8454 states. [2018-12-02 03:06:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8454 to 6145. [2018-12-02 03:06:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6145 states. [2018-12-02 03:06:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 13469 transitions. [2018-12-02 03:06:17,852 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 13469 transitions. Word has length 94 [2018-12-02 03:06:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:17,852 INFO L480 AbstractCegarLoop]: Abstraction has 6145 states and 13469 transitions. [2018-12-02 03:06:17,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 03:06:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 13469 transitions. [2018-12-02 03:06:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 03:06:17,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:17,856 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] [2018-12-02 03:06:17,856 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:17,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1818748071, now seen corresponding path program 2 times [2018-12-02 03:06:17,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:17,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:17,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:17,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:17,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:17,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:17,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 03:06:17,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 03:06:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:06:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:06:17,952 INFO L87 Difference]: Start difference. First operand 6145 states and 13469 transitions. Second operand 8 states. [2018-12-02 03:06:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:18,151 INFO L93 Difference]: Finished difference Result 7558 states and 16521 transitions. [2018-12-02 03:06:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 03:06:18,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-02 03:06:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:18,156 INFO L225 Difference]: With dead ends: 7558 [2018-12-02 03:06:18,156 INFO L226 Difference]: Without dead ends: 7558 [2018-12-02 03:06:18,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-02 03:06:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2018-12-02 03:06:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 6568. [2018-12-02 03:06:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6568 states. [2018-12-02 03:06:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6568 states to 6568 states and 14369 transitions. [2018-12-02 03:06:18,208 INFO L78 Accepts]: Start accepts. Automaton has 6568 states and 14369 transitions. Word has length 94 [2018-12-02 03:06:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:18,209 INFO L480 AbstractCegarLoop]: Abstraction has 6568 states and 14369 transitions. [2018-12-02 03:06:18,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 03:06:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 6568 states and 14369 transitions. [2018-12-02 03:06:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 03:06:18,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:18,213 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] [2018-12-02 03:06:18,213 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:18,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1588715544, now seen corresponding path program 2 times [2018-12-02 03:06:18,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:18,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:18,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:18,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:06:18,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:06:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:06:18,248 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 03:06:18,322 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 03:06:18,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:06:18 BasicIcfg [2018-12-02 03:06:18,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 03:06:18,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:06:18,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:06:18,324 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:06:18,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:06:02" (3/4) ... [2018-12-02 03:06:18,326 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 03:06:18,394 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_05ee3597-765f-4715-837e-791981eee786/bin-2019/uautomizer/witness.graphml [2018-12-02 03:06:18,394 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:06:18,395 INFO L168 Benchmark]: Toolchain (without parser) took 16697.93 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 954.9 MB in the beginning and 1.6 GB in the end (delta: -611.5 MB). Peak memory consumption was 926.3 MB. Max. memory is 11.5 GB. [2018-12-02 03:06:18,396 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:06:18,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 63.4 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -80.4 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-12-02 03:06:18,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-02 03:06:18,396 INFO L168 Benchmark]: Boogie Preprocessor took 19.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:06:18,396 INFO L168 Benchmark]: RCFGBuilder took 324.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 978.8 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-02 03:06:18,396 INFO L168 Benchmark]: TraceAbstraction took 15900.36 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 978.8 MB in the beginning and 1.6 GB in the end (delta: -619.9 MB). Peak memory consumption was 854.4 MB. Max. memory is 11.5 GB. [2018-12-02 03:06:18,397 INFO L168 Benchmark]: Witness Printer took 70.30 ms. Allocated memory is still 2.6 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-12-02 03:06:18,398 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 63.4 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -80.4 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 324.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 978.8 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15900.36 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 978.8 MB in the beginning and 1.6 GB in the end (delta: -619.9 MB). Peak memory consumption was 854.4 MB. Max. memory is 11.5 GB. * Witness Printer took 70.30 ms. Allocated memory is still 2.6 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 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] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -1 pthread_t t1445; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] FCALL, FORK -1 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 1 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 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, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1446; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 2 [L730] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 1 y$flush_delayed = weak$$choice2 [L733] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 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)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 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) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used 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)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 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) [L735] 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, 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))=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 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)) [L736] 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, 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=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 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)) [L737] 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, 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=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 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)) [L738] 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, 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=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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)) [L739] 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, 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=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 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)) [L740] 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, 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=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 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)) [L741] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$flush_delayed ? y$mem_tmp : y [L743] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] 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=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 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 [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] 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=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 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 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] 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) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] 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 [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L750] 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 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 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -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) [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L779] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -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 [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L781] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -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 [L784] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. UNSAFE Result, 15.8s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8356 SDtfs, 9100 SDslu, 20553 SDs, 0 SdLazy, 8607 SolverSat, 425 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 90 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34805occurred in iteration=0, 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: 4.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 86864 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2442 NumberOfCodeBlocks, 2442 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2316 ConstructedInterpolants, 0 QuantifiedInterpolants, 502579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...