./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_tso.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_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/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 329b7a48e556584de8d61f30845ded50594e4269 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-09 05:51:09,671 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:51:09,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:51:09,678 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:51:09,678 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:51:09,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:51:09,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:51:09,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:51:09,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:51:09,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:51:09,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:51:09,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:51:09,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:51:09,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:51:09,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:51:09,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:51:09,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:51:09,685 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:51:09,686 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:51:09,687 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:51:09,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:51:09,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:51:09,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:51:09,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:51:09,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:51:09,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:51:09,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:51:09,690 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:51:09,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:51:09,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:51:09,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:51:09,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:51:09,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:51:09,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:51:09,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:51:09,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:51:09,693 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 05:51:09,700 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:51:09,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:51:09,700 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:51:09,701 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:51:09,701 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:51:09,701 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:51:09,701 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 05:51:09,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:51:09,701 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:51:09,701 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:51:09,701 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:51:09,701 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:51:09,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:51:09,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:51:09,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:51:09,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:51:09,703 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:51:09,703 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 05:51:09,703 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:51:09,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:51:09,703 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_61564265-e4cd-434e-a1a7-0dadebe92e3a/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 -> 329b7a48e556584de8d61f30845ded50594e4269 [2018-12-09 05:51:09,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:51:09,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:51:09,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:51:09,735 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:51:09,735 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:51:09,735 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i [2018-12-09 05:51:09,776 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/data/4a9d9e1b6/f364e6b079ac481ba61bffb62e78be01/FLAGa4eb68e38 [2018-12-09 05:51:10,225 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:51:10,226 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i [2018-12-09 05:51:10,233 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/data/4a9d9e1b6/f364e6b079ac481ba61bffb62e78be01/FLAGa4eb68e38 [2018-12-09 05:51:10,241 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/data/4a9d9e1b6/f364e6b079ac481ba61bffb62e78be01 [2018-12-09 05:51:10,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:51:10,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:51:10,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:51:10,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:51:10,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:51:10,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10, skipping insertion in model container [2018-12-09 05:51:10,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:51:10,273 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:51:10,448 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:51:10,456 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:51:10,529 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:51:10,558 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:51:10,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10 WrapperNode [2018-12-09 05:51:10,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:51:10,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:51:10,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:51:10,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:51:10,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:51:10,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:51:10,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:51:10,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:51:10,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (1/1) ... [2018-12-09 05:51:10,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:51:10,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:51:10,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:51:10,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:51:10,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/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-09 05:51:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:51:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 05:51:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 05:51:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 05:51:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 05:51:10,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 05:51:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 05:51:10,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 05:51:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 05:51:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:51:10,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:51:10,651 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 05:51:10,978 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:51:10,978 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 05:51:10,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:51:10 BoogieIcfgContainer [2018-12-09 05:51:10,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:51:10,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:51:10,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:51:10,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:51:10,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:51:10" (1/3) ... [2018-12-09 05:51:10,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e986ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:51:10, skipping insertion in model container [2018-12-09 05:51:10,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:10" (2/3) ... [2018-12-09 05:51:10,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e986ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:51:10, skipping insertion in model container [2018-12-09 05:51:10,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:51:10" (3/3) ... [2018-12-09 05:51:10,983 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt_false-unreach-call.i [2018-12-09 05:51:11,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,006 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,006 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,010 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,010 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,010 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,010 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,010 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:51:11,017 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 05:51:11,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:51:11,023 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 05:51:11,032 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 05:51:11,046 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 05:51:11,046 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:51:11,046 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:51:11,047 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:51:11,047 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:51:11,047 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:51:11,047 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:51:11,047 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:51:11,047 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:51:11,053 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 05:51:11,897 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-09 05:51:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-09 05:51:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 05:51:11,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:11,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] [2018-12-09 05:51:11,905 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:11,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-12-09 05:51:11,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:11,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:11,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:11,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:11,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:12,043 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-09 05:51:12,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:12,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:51:12,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:51:12,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:51:12,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:51:12,056 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-09 05:51:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:12,390 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-09 05:51:12,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:51:12,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 05:51:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:12,537 INFO L225 Difference]: With dead ends: 45389 [2018-12-09 05:51:12,537 INFO L226 Difference]: Without dead ends: 40629 [2018-12-09 05:51:12,539 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-09 05:51:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-09 05:51:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-09 05:51:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 05:51:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-09 05:51:13,219 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-09 05:51:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:13,219 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-09 05:51:13,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:51:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-09 05:51:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 05:51:13,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:13,222 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-09 05:51:13,222 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:13,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1632937034, now seen corresponding path program 1 times [2018-12-09 05:51:13,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:13,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:13,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:13,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:13,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:13,262 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-09 05:51:13,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:13,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:51:13,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:51:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:51:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:51:13,264 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-09 05:51:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:13,409 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-09 05:51:13,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:51:13,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 05:51:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:13,449 INFO L225 Difference]: With dead ends: 23663 [2018-12-09 05:51:13,449 INFO L226 Difference]: Without dead ends: 23663 [2018-12-09 05:51:13,450 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-09 05:51:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-09 05:51:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-09 05:51:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 05:51:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-09 05:51:13,874 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-09 05:51:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:13,874 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-09 05:51:13,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:51:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-09 05:51:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 05:51:13,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:13,876 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-09 05:51:13,876 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:13,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:13,876 INFO L82 PathProgramCache]: Analyzing trace with hash -164014325, now seen corresponding path program 1 times [2018-12-09 05:51:13,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:13,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:13,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:13,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:13,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:13,921 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-09 05:51:13,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:13,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:51:13,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:51:13,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:51:13,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:51:13,922 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-09 05:51:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:14,481 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-09 05:51:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:51:14,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 05:51:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:14,607 INFO L225 Difference]: With dead ends: 64831 [2018-12-09 05:51:14,607 INFO L226 Difference]: Without dead ends: 64671 [2018-12-09 05:51:14,607 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-09 05:51:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-09 05:51:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-09 05:51:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-09 05:51:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-09 05:51:15,386 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-09 05:51:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:15,387 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-09 05:51:15,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:51:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-09 05:51:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 05:51:15,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:15,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:15,389 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:15,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:15,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-12-09 05:51:15,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:15,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:15,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:15,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:15,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:15,422 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-09 05:51:15,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:15,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:51:15,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:51:15,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:51:15,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:51:15,422 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-09 05:51:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:15,570 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-09 05:51:15,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:51:15,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-09 05:51:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:15,631 INFO L225 Difference]: With dead ends: 37143 [2018-12-09 05:51:15,631 INFO L226 Difference]: Without dead ends: 37143 [2018-12-09 05:51:15,631 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-09 05:51:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-09 05:51:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-09 05:51:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-09 05:51:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-09 05:51:16,257 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-09 05:51:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:16,257 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-09 05:51:16,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:51:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-09 05:51:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 05:51:16,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:16,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:16,259 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:16,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1043159878, now seen corresponding path program 1 times [2018-12-09 05:51:16,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:16,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:16,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:16,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:16,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:16,302 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-09 05:51:16,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:16,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:51:16,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:51:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:51:16,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:51:16,303 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 5 states. [2018-12-09 05:51:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:16,669 INFO L93 Difference]: Finished difference Result 66627 states and 246193 transitions. [2018-12-09 05:51:16,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:51:16,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 05:51:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:16,784 INFO L225 Difference]: With dead ends: 66627 [2018-12-09 05:51:16,784 INFO L226 Difference]: Without dead ends: 66459 [2018-12-09 05:51:16,784 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-09 05:51:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-09 05:51:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-09 05:51:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-09 05:51:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143650 transitions. [2018-12-09 05:51:17,557 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143650 transitions. Word has length 46 [2018-12-09 05:51:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:17,557 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143650 transitions. [2018-12-09 05:51:17,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:51:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143650 transitions. [2018-12-09 05:51:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 05:51:17,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:17,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:17,563 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:17,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:17,563 INFO L82 PathProgramCache]: Analyzing trace with hash 942235242, now seen corresponding path program 1 times [2018-12-09 05:51:17,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:17,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:17,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:17,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:17,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:51:17,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:17,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:51:17,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:51:17,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:51:17,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:51:17,594 INFO L87 Difference]: Start difference. First operand 38835 states and 143650 transitions. Second operand 4 states. [2018-12-09 05:51:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:17,648 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2018-12-09 05:51:17,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:51:17,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 05:51:17,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:17,665 INFO L225 Difference]: With dead ends: 14217 [2018-12-09 05:51:17,665 INFO L226 Difference]: Without dead ends: 13696 [2018-12-09 05:51:17,666 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-09 05:51:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-12-09 05:51:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-12-09 05:51:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-12-09 05:51:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2018-12-09 05:51:17,812 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2018-12-09 05:51:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:17,813 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2018-12-09 05:51:17,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:51:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2018-12-09 05:51:17,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 05:51:17,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:17,816 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-09 05:51:17,816 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:17,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:17,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1496318134, now seen corresponding path program 1 times [2018-12-09 05:51:17,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:17,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:17,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:17,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:17,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:17,870 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-09 05:51:17,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:17,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:51:17,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:51:17,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:51:17,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:51:17,870 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2018-12-09 05:51:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:18,017 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2018-12-09 05:51:18,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:51:18,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 05:51:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:18,039 INFO L225 Difference]: With dead ends: 19084 [2018-12-09 05:51:18,039 INFO L226 Difference]: Without dead ends: 19084 [2018-12-09 05:51:18,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:51:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2018-12-09 05:51:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2018-12-09 05:51:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2018-12-09 05:51:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2018-12-09 05:51:18,212 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2018-12-09 05:51:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:18,212 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2018-12-09 05:51:18,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:51:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2018-12-09 05:51:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 05:51:18,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:18,216 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-09 05:51:18,216 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:18,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1055838827, now seen corresponding path program 1 times [2018-12-09 05:51:18,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:18,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:18,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:18,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:18,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:18,274 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-09 05:51:18,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:18,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:51:18,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:51:18,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:51:18,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:51:18,275 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 4 states. [2018-12-09 05:51:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:18,772 INFO L93 Difference]: Finished difference Result 20683 states and 67222 transitions. [2018-12-09 05:51:18,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:51:18,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 05:51:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:18,803 INFO L225 Difference]: With dead ends: 20683 [2018-12-09 05:51:18,803 INFO L226 Difference]: Without dead ends: 20683 [2018-12-09 05:51:18,803 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-09 05:51:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20683 states. [2018-12-09 05:51:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20683 to 18616. [2018-12-09 05:51:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18616 states. [2018-12-09 05:51:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 60973 transitions. [2018-12-09 05:51:19,017 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 60973 transitions. Word has length 59 [2018-12-09 05:51:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:19,017 INFO L480 AbstractCegarLoop]: Abstraction has 18616 states and 60973 transitions. [2018-12-09 05:51:19,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:51:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 60973 transitions. [2018-12-09 05:51:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 05:51:19,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:19,021 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-09 05:51:19,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:19,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash 297470870, now seen corresponding path program 1 times [2018-12-09 05:51:19,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:19,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:19,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:19,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:19,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:19,082 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-09 05:51:19,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:19,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:51:19,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:51:19,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:51:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:51:19,083 INFO L87 Difference]: Start difference. First operand 18616 states and 60973 transitions. Second operand 6 states. [2018-12-09 05:51:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:19,448 INFO L93 Difference]: Finished difference Result 24160 states and 78371 transitions. [2018-12-09 05:51:19,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 05:51:19,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-09 05:51:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:19,477 INFO L225 Difference]: With dead ends: 24160 [2018-12-09 05:51:19,477 INFO L226 Difference]: Without dead ends: 24128 [2018-12-09 05:51:19,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 05:51:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24128 states. [2018-12-09 05:51:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24128 to 18248. [2018-12-09 05:51:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18248 states. [2018-12-09 05:51:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18248 states to 18248 states and 59757 transitions. [2018-12-09 05:51:19,698 INFO L78 Accepts]: Start accepts. Automaton has 18248 states and 59757 transitions. Word has length 59 [2018-12-09 05:51:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:19,698 INFO L480 AbstractCegarLoop]: Abstraction has 18248 states and 59757 transitions. [2018-12-09 05:51:19,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:51:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 18248 states and 59757 transitions. [2018-12-09 05:51:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 05:51:19,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:19,709 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] [2018-12-09 05:51:19,709 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:19,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash 508362432, now seen corresponding path program 1 times [2018-12-09 05:51:19,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:19,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:19,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:19,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:19,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:19,751 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-09 05:51:19,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:19,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:51:19,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:51:19,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:51:19,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:51:19,752 INFO L87 Difference]: Start difference. First operand 18248 states and 59757 transitions. Second operand 4 states. [2018-12-09 05:51:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:20,072 INFO L93 Difference]: Finished difference Result 29316 states and 94246 transitions. [2018-12-09 05:51:20,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:51:20,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-09 05:51:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:20,109 INFO L225 Difference]: With dead ends: 29316 [2018-12-09 05:51:20,109 INFO L226 Difference]: Without dead ends: 29120 [2018-12-09 05:51:20,109 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-09 05:51:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29120 states. [2018-12-09 05:51:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29120 to 24768. [2018-12-09 05:51:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24768 states. [2018-12-09 05:51:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24768 states to 24768 states and 80579 transitions. [2018-12-09 05:51:20,410 INFO L78 Accepts]: Start accepts. Automaton has 24768 states and 80579 transitions. Word has length 73 [2018-12-09 05:51:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:20,410 INFO L480 AbstractCegarLoop]: Abstraction has 24768 states and 80579 transitions. [2018-12-09 05:51:20,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:51:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 24768 states and 80579 transitions. [2018-12-09 05:51:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 05:51:20,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:20,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:20,426 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:20,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1861672129, now seen corresponding path program 1 times [2018-12-09 05:51:20,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:20,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:20,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:20,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:20,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:20,514 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-09 05:51:20,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:20,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 05:51:20,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 05:51:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 05:51:20,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:51:20,515 INFO L87 Difference]: Start difference. First operand 24768 states and 80579 transitions. Second operand 8 states. [2018-12-09 05:51:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:21,730 INFO L93 Difference]: Finished difference Result 37722 states and 118602 transitions. [2018-12-09 05:51:21,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 05:51:21,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-12-09 05:51:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:21,774 INFO L225 Difference]: With dead ends: 37722 [2018-12-09 05:51:21,775 INFO L226 Difference]: Without dead ends: 37474 [2018-12-09 05:51:21,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 05:51:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37474 states. [2018-12-09 05:51:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37474 to 27365. [2018-12-09 05:51:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27365 states. [2018-12-09 05:51:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27365 states to 27365 states and 88367 transitions. [2018-12-09 05:51:22,161 INFO L78 Accepts]: Start accepts. Automaton has 27365 states and 88367 transitions. Word has length 73 [2018-12-09 05:51:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:22,161 INFO L480 AbstractCegarLoop]: Abstraction has 27365 states and 88367 transitions. [2018-12-09 05:51:22,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 05:51:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 27365 states and 88367 transitions. [2018-12-09 05:51:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 05:51:22,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:22,179 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] [2018-12-09 05:51:22,179 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:22,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:22,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1568269122, now seen corresponding path program 1 times [2018-12-09 05:51:22,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:22,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:22,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:22,238 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-09 05:51:22,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:22,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 05:51:22,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 05:51:22,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 05:51:22,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:51:22,239 INFO L87 Difference]: Start difference. First operand 27365 states and 88367 transitions. Second operand 8 states. [2018-12-09 05:51:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:23,068 INFO L93 Difference]: Finished difference Result 34993 states and 111268 transitions. [2018-12-09 05:51:23,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 05:51:23,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-12-09 05:51:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:23,116 INFO L225 Difference]: With dead ends: 34993 [2018-12-09 05:51:23,117 INFO L226 Difference]: Without dead ends: 34929 [2018-12-09 05:51:23,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-12-09 05:51:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34929 states. [2018-12-09 05:51:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34929 to 29457. [2018-12-09 05:51:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29457 states. [2018-12-09 05:51:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29457 states to 29457 states and 94772 transitions. [2018-12-09 05:51:23,481 INFO L78 Accepts]: Start accepts. Automaton has 29457 states and 94772 transitions. Word has length 73 [2018-12-09 05:51:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:23,482 INFO L480 AbstractCegarLoop]: Abstraction has 29457 states and 94772 transitions. [2018-12-09 05:51:23,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 05:51:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 29457 states and 94772 transitions. [2018-12-09 05:51:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 05:51:23,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:23,501 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] [2018-12-09 05:51:23,502 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:23,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:23,502 INFO L82 PathProgramCache]: Analyzing trace with hash 749030577, now seen corresponding path program 1 times [2018-12-09 05:51:23,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:23,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:23,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:23,525 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-09 05:51:23,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:23,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:51:23,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:51:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:51:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:51:23,526 INFO L87 Difference]: Start difference. First operand 29457 states and 94772 transitions. Second operand 3 states. [2018-12-09 05:51:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:23,625 INFO L93 Difference]: Finished difference Result 34177 states and 108640 transitions. [2018-12-09 05:51:23,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:51:23,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-09 05:51:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:23,664 INFO L225 Difference]: With dead ends: 34177 [2018-12-09 05:51:23,664 INFO L226 Difference]: Without dead ends: 34177 [2018-12-09 05:51:23,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:51:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34177 states. [2018-12-09 05:51:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34177 to 31025. [2018-12-09 05:51:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31025 states. [2018-12-09 05:51:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31025 states to 31025 states and 99252 transitions. [2018-12-09 05:51:24,014 INFO L78 Accepts]: Start accepts. Automaton has 31025 states and 99252 transitions. Word has length 75 [2018-12-09 05:51:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:24,014 INFO L480 AbstractCegarLoop]: Abstraction has 31025 states and 99252 transitions. [2018-12-09 05:51:24,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:51:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 31025 states and 99252 transitions. [2018-12-09 05:51:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 05:51:24,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:24,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:24,038 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:24,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1031472080, now seen corresponding path program 1 times [2018-12-09 05:51:24,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:24,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:24,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:24,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:24,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:24,139 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-09 05:51:24,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:24,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 05:51:24,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 05:51:24,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 05:51:24,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:51:24,140 INFO L87 Difference]: Start difference. First operand 31025 states and 99252 transitions. Second operand 10 states. [2018-12-09 05:51:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:25,860 INFO L93 Difference]: Finished difference Result 40629 states and 126835 transitions. [2018-12-09 05:51:25,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 05:51:25,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-12-09 05:51:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:25,910 INFO L225 Difference]: With dead ends: 40629 [2018-12-09 05:51:25,910 INFO L226 Difference]: Without dead ends: 40565 [2018-12-09 05:51:25,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 05:51:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40565 states. [2018-12-09 05:51:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40565 to 33477. [2018-12-09 05:51:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33477 states. [2018-12-09 05:51:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33477 states to 33477 states and 106323 transitions. [2018-12-09 05:51:26,302 INFO L78 Accepts]: Start accepts. Automaton has 33477 states and 106323 transitions. Word has length 79 [2018-12-09 05:51:26,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:26,302 INFO L480 AbstractCegarLoop]: Abstraction has 33477 states and 106323 transitions. [2018-12-09 05:51:26,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 05:51:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 33477 states and 106323 transitions. [2018-12-09 05:51:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 05:51:26,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:26,331 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] [2018-12-09 05:51:26,331 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:26,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:26,331 INFO L82 PathProgramCache]: Analyzing trace with hash -341105651, now seen corresponding path program 1 times [2018-12-09 05:51:26,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:26,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:26,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:26,368 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-09 05:51:26,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:26,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:51:26,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:51:26,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:51:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:51:26,369 INFO L87 Difference]: Start difference. First operand 33477 states and 106323 transitions. Second operand 4 states. [2018-12-09 05:51:26,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:26,677 INFO L93 Difference]: Finished difference Result 39513 states and 123931 transitions. [2018-12-09 05:51:26,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:51:26,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 05:51:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:26,722 INFO L225 Difference]: With dead ends: 39513 [2018-12-09 05:51:26,723 INFO L226 Difference]: Without dead ends: 39273 [2018-12-09 05:51:26,723 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-09 05:51:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39273 states. [2018-12-09 05:51:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39273 to 37605. [2018-12-09 05:51:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37605 states. [2018-12-09 05:51:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37605 states to 37605 states and 118468 transitions. [2018-12-09 05:51:27,125 INFO L78 Accepts]: Start accepts. Automaton has 37605 states and 118468 transitions. Word has length 81 [2018-12-09 05:51:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:27,125 INFO L480 AbstractCegarLoop]: Abstraction has 37605 states and 118468 transitions. [2018-12-09 05:51:27,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:51:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 37605 states and 118468 transitions. [2018-12-09 05:51:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 05:51:27,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:27,154 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] [2018-12-09 05:51:27,154 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:27,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:27,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2018201358, now seen corresponding path program 1 times [2018-12-09 05:51:27,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:27,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:27,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:27,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:27,189 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-09 05:51:27,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:27,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:51:27,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:51:27,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:51:27,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:51:27,190 INFO L87 Difference]: Start difference. First operand 37605 states and 118468 transitions. Second operand 3 states. [2018-12-09 05:51:27,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:27,384 INFO L93 Difference]: Finished difference Result 39589 states and 124426 transitions. [2018-12-09 05:51:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:51:27,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 05:51:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:27,432 INFO L225 Difference]: With dead ends: 39589 [2018-12-09 05:51:27,432 INFO L226 Difference]: Without dead ends: 39589 [2018-12-09 05:51:27,433 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-09 05:51:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39589 states. [2018-12-09 05:51:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39589 to 38593. [2018-12-09 05:51:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38593 states. [2018-12-09 05:51:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38593 states to 38593 states and 121424 transitions. [2018-12-09 05:51:27,923 INFO L78 Accepts]: Start accepts. Automaton has 38593 states and 121424 transitions. Word has length 81 [2018-12-09 05:51:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:27,923 INFO L480 AbstractCegarLoop]: Abstraction has 38593 states and 121424 transitions. [2018-12-09 05:51:27,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:51:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 38593 states and 121424 transitions. [2018-12-09 05:51:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 05:51:27,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:27,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:27,948 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:27,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:27,948 INFO L82 PathProgramCache]: Analyzing trace with hash -259330474, now seen corresponding path program 1 times [2018-12-09 05:51:27,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:27,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:27,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:27,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:27,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:27,977 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-09 05:51:27,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:27,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:51:27,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:51:27,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:51:27,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:51:27,978 INFO L87 Difference]: Start difference. First operand 38593 states and 121424 transitions. Second operand 3 states. [2018-12-09 05:51:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:28,072 INFO L93 Difference]: Finished difference Result 36440 states and 112816 transitions. [2018-12-09 05:51:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:51:28,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-09 05:51:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:28,116 INFO L225 Difference]: With dead ends: 36440 [2018-12-09 05:51:28,116 INFO L226 Difference]: Without dead ends: 36440 [2018-12-09 05:51:28,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:51:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36440 states. [2018-12-09 05:51:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36440 to 34804. [2018-12-09 05:51:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34804 states. [2018-12-09 05:51:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34804 states to 34804 states and 108109 transitions. [2018-12-09 05:51:28,491 INFO L78 Accepts]: Start accepts. Automaton has 34804 states and 108109 transitions. Word has length 82 [2018-12-09 05:51:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:28,491 INFO L480 AbstractCegarLoop]: Abstraction has 34804 states and 108109 transitions. [2018-12-09 05:51:28,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:51:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 34804 states and 108109 transitions. [2018-12-09 05:51:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 05:51:28,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:28,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:28,516 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:28,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash 70435287, now seen corresponding path program 1 times [2018-12-09 05:51:28,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:28,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:28,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:28,564 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-09 05:51:28,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:28,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:51:28,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:51:28,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:51:28,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:51:28,564 INFO L87 Difference]: Start difference. First operand 34804 states and 108109 transitions. Second operand 7 states. [2018-12-09 05:51:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:29,173 INFO L93 Difference]: Finished difference Result 61448 states and 189280 transitions. [2018-12-09 05:51:29,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 05:51:29,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-09 05:51:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:29,247 INFO L225 Difference]: With dead ends: 61448 [2018-12-09 05:51:29,247 INFO L226 Difference]: Without dead ends: 61112 [2018-12-09 05:51:29,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:51:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61112 states. [2018-12-09 05:51:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61112 to 36161. [2018-12-09 05:51:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36161 states. [2018-12-09 05:51:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36161 states to 36161 states and 112088 transitions. [2018-12-09 05:51:29,772 INFO L78 Accepts]: Start accepts. Automaton has 36161 states and 112088 transitions. Word has length 82 [2018-12-09 05:51:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:29,772 INFO L480 AbstractCegarLoop]: Abstraction has 36161 states and 112088 transitions. [2018-12-09 05:51:29,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:51:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 36161 states and 112088 transitions. [2018-12-09 05:51:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 05:51:29,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:29,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:29,796 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:29,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:29,797 INFO L82 PathProgramCache]: Analyzing trace with hash -852248296, now seen corresponding path program 1 times [2018-12-09 05:51:29,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:29,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:29,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:29,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:29,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:29,865 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-09 05:51:29,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:29,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 05:51:29,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 05:51:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 05:51:29,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:51:29,866 INFO L87 Difference]: Start difference. First operand 36161 states and 112088 transitions. Second operand 8 states. [2018-12-09 05:51:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:30,700 INFO L93 Difference]: Finished difference Result 53145 states and 161315 transitions. [2018-12-09 05:51:30,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 05:51:30,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-09 05:51:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:30,772 INFO L225 Difference]: With dead ends: 53145 [2018-12-09 05:51:30,772 INFO L226 Difference]: Without dead ends: 53145 [2018-12-09 05:51:30,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-09 05:51:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53145 states. [2018-12-09 05:51:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53145 to 35117. [2018-12-09 05:51:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35117 states. [2018-12-09 05:51:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35117 states to 35117 states and 108430 transitions. [2018-12-09 05:51:31,338 INFO L78 Accepts]: Start accepts. Automaton has 35117 states and 108430 transitions. Word has length 82 [2018-12-09 05:51:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:31,338 INFO L480 AbstractCegarLoop]: Abstraction has 35117 states and 108430 transitions. [2018-12-09 05:51:31,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 05:51:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 35117 states and 108430 transitions. [2018-12-09 05:51:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 05:51:31,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:31,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:31,366 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:31,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash 873232601, now seen corresponding path program 1 times [2018-12-09 05:51:31,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:31,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:31,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:31,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:31,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:31,494 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-09 05:51:31,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:31,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:51:31,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:51:31,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:51:31,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:51:31,494 INFO L87 Difference]: Start difference. First operand 35117 states and 108430 transitions. Second operand 5 states. [2018-12-09 05:51:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:31,520 INFO L93 Difference]: Finished difference Result 4641 states and 11865 transitions. [2018-12-09 05:51:31,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:51:31,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 05:51:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:31,523 INFO L225 Difference]: With dead ends: 4641 [2018-12-09 05:51:31,523 INFO L226 Difference]: Without dead ends: 4025 [2018-12-09 05:51:31,523 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-09 05:51:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-12-09 05:51:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3903. [2018-12-09 05:51:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3903 states. [2018-12-09 05:51:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 9981 transitions. [2018-12-09 05:51:31,548 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 9981 transitions. Word has length 82 [2018-12-09 05:51:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:31,548 INFO L480 AbstractCegarLoop]: Abstraction has 3903 states and 9981 transitions. [2018-12-09 05:51:31,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:51:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 9981 transitions. [2018-12-09 05:51:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:51:31,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:31,551 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-09 05:51:31,551 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:31,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:31,551 INFO L82 PathProgramCache]: Analyzing trace with hash -977364778, now seen corresponding path program 1 times [2018-12-09 05:51:31,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:31,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:31,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:31,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:31,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:31,619 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-09 05:51:31,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:31,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 05:51:31,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 05:51:31,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 05:51:31,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:51:31,620 INFO L87 Difference]: Start difference. First operand 3903 states and 9981 transitions. Second operand 8 states. [2018-12-09 05:51:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:31,959 INFO L93 Difference]: Finished difference Result 6980 states and 17751 transitions. [2018-12-09 05:51:31,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 05:51:31,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-09 05:51:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:31,964 INFO L225 Difference]: With dead ends: 6980 [2018-12-09 05:51:31,964 INFO L226 Difference]: Without dead ends: 6948 [2018-12-09 05:51:31,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 05:51:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2018-12-09 05:51:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 4115. [2018-12-09 05:51:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4115 states. [2018-12-09 05:51:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 10495 transitions. [2018-12-09 05:51:31,999 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 10495 transitions. Word has length 94 [2018-12-09 05:51:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:31,999 INFO L480 AbstractCegarLoop]: Abstraction has 4115 states and 10495 transitions. [2018-12-09 05:51:31,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 05:51:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 10495 transitions. [2018-12-09 05:51:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:51:32,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:32,002 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-09 05:51:32,002 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:32,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash -15750761, now seen corresponding path program 1 times [2018-12-09 05:51:32,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:32,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:32,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:32,033 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-09 05:51:32,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:32,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:51:32,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:51:32,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:51:32,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:51:32,034 INFO L87 Difference]: Start difference. First operand 4115 states and 10495 transitions. Second operand 5 states. [2018-12-09 05:51:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:32,138 INFO L93 Difference]: Finished difference Result 4847 states and 12188 transitions. [2018-12-09 05:51:32,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:51:32,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 05:51:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:32,142 INFO L225 Difference]: With dead ends: 4847 [2018-12-09 05:51:32,142 INFO L226 Difference]: Without dead ends: 4847 [2018-12-09 05:51:32,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:51:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2018-12-09 05:51:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4271. [2018-12-09 05:51:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4271 states. [2018-12-09 05:51:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 10831 transitions. [2018-12-09 05:51:32,172 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 10831 transitions. Word has length 94 [2018-12-09 05:51:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:32,172 INFO L480 AbstractCegarLoop]: Abstraction has 4271 states and 10831 transitions. [2018-12-09 05:51:32,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:51:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 10831 transitions. [2018-12-09 05:51:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:51:32,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:32,174 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-09 05:51:32,174 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:32,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:32,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1153917381, now seen corresponding path program 1 times [2018-12-09 05:51:32,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:32,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:32,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:32,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:32,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:32,214 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-09 05:51:32,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:32,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:51:32,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:51:32,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:51:32,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:51:32,215 INFO L87 Difference]: Start difference. First operand 4271 states and 10831 transitions. Second operand 6 states. [2018-12-09 05:51:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:32,384 INFO L93 Difference]: Finished difference Result 4582 states and 11436 transitions. [2018-12-09 05:51:32,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:51:32,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 05:51:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:32,387 INFO L225 Difference]: With dead ends: 4582 [2018-12-09 05:51:32,387 INFO L226 Difference]: Without dead ends: 4545 [2018-12-09 05:51:32,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-09 05:51:32,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2018-12-09 05:51:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4457. [2018-12-09 05:51:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4457 states. [2018-12-09 05:51:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4457 states to 4457 states and 11198 transitions. [2018-12-09 05:51:32,416 INFO L78 Accepts]: Start accepts. Automaton has 4457 states and 11198 transitions. Word has length 94 [2018-12-09 05:51:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:32,416 INFO L480 AbstractCegarLoop]: Abstraction has 4457 states and 11198 transitions. [2018-12-09 05:51:32,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:51:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4457 states and 11198 transitions. [2018-12-09 05:51:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:51:32,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:32,418 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-09 05:51:32,419 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:32,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1440309436, now seen corresponding path program 1 times [2018-12-09 05:51:32,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:32,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:32,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:32,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:32,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:32,486 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-09 05:51:32,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:32,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:51:32,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:51:32,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:51:32,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:51:32,487 INFO L87 Difference]: Start difference. First operand 4457 states and 11198 transitions. Second operand 7 states. [2018-12-09 05:51:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:32,655 INFO L93 Difference]: Finished difference Result 4757 states and 11937 transitions. [2018-12-09 05:51:32,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:51:32,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 05:51:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:32,658 INFO L225 Difference]: With dead ends: 4757 [2018-12-09 05:51:32,659 INFO L226 Difference]: Without dead ends: 4757 [2018-12-09 05:51:32,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:51:32,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2018-12-09 05:51:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 4431. [2018-12-09 05:51:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4431 states. [2018-12-09 05:51:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 11153 transitions. [2018-12-09 05:51:32,691 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 11153 transitions. Word has length 94 [2018-12-09 05:51:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:32,691 INFO L480 AbstractCegarLoop]: Abstraction has 4431 states and 11153 transitions. [2018-12-09 05:51:32,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:51:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 11153 transitions. [2018-12-09 05:51:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:51:32,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:32,694 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-09 05:51:32,694 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:32,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:32,695 INFO L82 PathProgramCache]: Analyzing trace with hash -29429916, now seen corresponding path program 1 times [2018-12-09 05:51:32,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:32,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:32,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:32,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:32,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:32,738 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-09 05:51:32,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:32,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:51:32,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:51:32,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:51:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:51:32,739 INFO L87 Difference]: Start difference. First operand 4431 states and 11153 transitions. Second operand 5 states. [2018-12-09 05:51:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:32,802 INFO L93 Difference]: Finished difference Result 4142 states and 10429 transitions. [2018-12-09 05:51:32,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:51:32,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 05:51:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:32,805 INFO L225 Difference]: With dead ends: 4142 [2018-12-09 05:51:32,805 INFO L226 Difference]: Without dead ends: 4142 [2018-12-09 05:51:32,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:51:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2018-12-09 05:51:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 4062. [2018-12-09 05:51:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2018-12-09 05:51:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 10264 transitions. [2018-12-09 05:51:32,830 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 10264 transitions. Word has length 94 [2018-12-09 05:51:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:32,830 INFO L480 AbstractCegarLoop]: Abstraction has 4062 states and 10264 transitions. [2018-12-09 05:51:32,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:51:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 10264 transitions. [2018-12-09 05:51:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:51:32,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:32,833 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-09 05:51:32,833 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:32,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2076165861, now seen corresponding path program 1 times [2018-12-09 05:51:32,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:32,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:32,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:32,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:32,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:32,868 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-09 05:51:32,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:32,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:51:32,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:51:32,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:51:32,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:51:32,869 INFO L87 Difference]: Start difference. First operand 4062 states and 10264 transitions. Second operand 5 states. [2018-12-09 05:51:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:32,967 INFO L93 Difference]: Finished difference Result 8009 states and 20474 transitions. [2018-12-09 05:51:32,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:51:32,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 05:51:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:32,973 INFO L225 Difference]: With dead ends: 8009 [2018-12-09 05:51:32,973 INFO L226 Difference]: Without dead ends: 8009 [2018-12-09 05:51:32,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:51:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8009 states. [2018-12-09 05:51:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8009 to 4108. [2018-12-09 05:51:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4108 states. [2018-12-09 05:51:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 10355 transitions. [2018-12-09 05:51:33,013 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 10355 transitions. Word has length 94 [2018-12-09 05:51:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:33,013 INFO L480 AbstractCegarLoop]: Abstraction has 4108 states and 10355 transitions. [2018-12-09 05:51:33,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:51:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 10355 transitions. [2018-12-09 05:51:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:51:33,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:33,015 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-09 05:51:33,015 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:33,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash -140505574, now seen corresponding path program 1 times [2018-12-09 05:51:33,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:33,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:33,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:33,087 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-09 05:51:33,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:33,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:51:33,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:51:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:51:33,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:51:33,088 INFO L87 Difference]: Start difference. First operand 4108 states and 10355 transitions. Second operand 6 states. [2018-12-09 05:51:33,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:33,167 INFO L93 Difference]: Finished difference Result 3868 states and 9563 transitions. [2018-12-09 05:51:33,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:51:33,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 05:51:33,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:33,170 INFO L225 Difference]: With dead ends: 3868 [2018-12-09 05:51:33,170 INFO L226 Difference]: Without dead ends: 3868 [2018-12-09 05:51:33,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:51:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2018-12-09 05:51:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3305. [2018-12-09 05:51:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2018-12-09 05:51:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 8242 transitions. [2018-12-09 05:51:33,194 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 8242 transitions. Word has length 94 [2018-12-09 05:51:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:33,194 INFO L480 AbstractCegarLoop]: Abstraction has 3305 states and 8242 transitions. [2018-12-09 05:51:33,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:51:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 8242 transitions. [2018-12-09 05:51:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 05:51:33,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:33,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:33,197 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:33,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:33,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1976571392, now seen corresponding path program 1 times [2018-12-09 05:51:33,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:33,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:33,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:33,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:33,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:33,259 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-09 05:51:33,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:33,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:51:33,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:51:33,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:51:33,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:51:33,260 INFO L87 Difference]: Start difference. First operand 3305 states and 8242 transitions. Second operand 7 states. [2018-12-09 05:51:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:33,386 INFO L93 Difference]: Finished difference Result 3314 states and 8245 transitions. [2018-12-09 05:51:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:51:33,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 05:51:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:33,388 INFO L225 Difference]: With dead ends: 3314 [2018-12-09 05:51:33,388 INFO L226 Difference]: Without dead ends: 3314 [2018-12-09 05:51:33,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:51:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-12-09 05:51:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 3270. [2018-12-09 05:51:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2018-12-09 05:51:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 8161 transitions. [2018-12-09 05:51:33,409 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 8161 transitions. Word has length 96 [2018-12-09 05:51:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:33,410 INFO L480 AbstractCegarLoop]: Abstraction has 3270 states and 8161 transitions. [2018-12-09 05:51:33,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:51:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 8161 transitions. [2018-12-09 05:51:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 05:51:33,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:33,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:33,412 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:33,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1403397184, now seen corresponding path program 1 times [2018-12-09 05:51:33,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:33,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:33,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:33,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:33,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:33,448 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-09 05:51:33,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:33,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:51:33,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:51:33,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:51:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:51:33,449 INFO L87 Difference]: Start difference. First operand 3270 states and 8161 transitions. Second operand 5 states. [2018-12-09 05:51:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:33,551 INFO L93 Difference]: Finished difference Result 3718 states and 9265 transitions. [2018-12-09 05:51:33,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:51:33,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 05:51:33,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:33,554 INFO L225 Difference]: With dead ends: 3718 [2018-12-09 05:51:33,554 INFO L226 Difference]: Without dead ends: 3686 [2018-12-09 05:51:33,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:51:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2018-12-09 05:51:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3086. [2018-12-09 05:51:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3086 states. [2018-12-09 05:51:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 7702 transitions. [2018-12-09 05:51:33,577 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 7702 transitions. Word has length 96 [2018-12-09 05:51:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:33,578 INFO L480 AbstractCegarLoop]: Abstraction has 3086 states and 7702 transitions. [2018-12-09 05:51:33,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:51:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 7702 transitions. [2018-12-09 05:51:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 05:51:33,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:33,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:33,580 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:33,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:33,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1646805631, now seen corresponding path program 1 times [2018-12-09 05:51:33,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:33,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:33,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:33,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:33,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:33,678 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-09 05:51:33,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:33,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 05:51:33,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 05:51:33,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 05:51:33,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:51:33,679 INFO L87 Difference]: Start difference. First operand 3086 states and 7702 transitions. Second operand 10 states. [2018-12-09 05:51:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:33,938 INFO L93 Difference]: Finished difference Result 5201 states and 13167 transitions. [2018-12-09 05:51:33,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:51:33,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-09 05:51:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:33,940 INFO L225 Difference]: With dead ends: 5201 [2018-12-09 05:51:33,940 INFO L226 Difference]: Without dead ends: 2091 [2018-12-09 05:51:33,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 05:51:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2018-12-09 05:51:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2091. [2018-12-09 05:51:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2018-12-09 05:51:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 5397 transitions. [2018-12-09 05:51:33,953 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 5397 transitions. Word has length 96 [2018-12-09 05:51:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:33,953 INFO L480 AbstractCegarLoop]: Abstraction has 2091 states and 5397 transitions. [2018-12-09 05:51:33,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 05:51:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 5397 transitions. [2018-12-09 05:51:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 05:51:33,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:33,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:33,955 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:33,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:33,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1343180800, now seen corresponding path program 2 times [2018-12-09 05:51:33,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:33,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:33,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:33,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:51:33,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:33,997 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-09 05:51:33,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:33,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:51:33,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:51:33,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:51:33,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:51:33,997 INFO L87 Difference]: Start difference. First operand 2091 states and 5397 transitions. Second operand 5 states. [2018-12-09 05:51:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:34,017 INFO L93 Difference]: Finished difference Result 2091 states and 5387 transitions. [2018-12-09 05:51:34,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:51:34,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 05:51:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:34,019 INFO L225 Difference]: With dead ends: 2091 [2018-12-09 05:51:34,019 INFO L226 Difference]: Without dead ends: 2091 [2018-12-09 05:51:34,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:51:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2018-12-09 05:51:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2051. [2018-12-09 05:51:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-12-09 05:51:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 5303 transitions. [2018-12-09 05:51:34,033 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 5303 transitions. Word has length 96 [2018-12-09 05:51:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:34,033 INFO L480 AbstractCegarLoop]: Abstraction has 2051 states and 5303 transitions. [2018-12-09 05:51:34,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:51:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 5303 transitions. [2018-12-09 05:51:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 05:51:34,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:34,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:34,035 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:34,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:34,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1013415039, now seen corresponding path program 2 times [2018-12-09 05:51:34,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:34,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:34,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:51:34,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:51:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:51:34,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:51:34,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 05:51:34,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 05:51:34,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 05:51:34,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:51:34,119 INFO L87 Difference]: Start difference. First operand 2051 states and 5303 transitions. Second operand 12 states. [2018-12-09 05:51:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:51:34,470 INFO L93 Difference]: Finished difference Result 3882 states and 10151 transitions. [2018-12-09 05:51:34,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 05:51:34,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-09 05:51:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:51:34,472 INFO L225 Difference]: With dead ends: 3882 [2018-12-09 05:51:34,472 INFO L226 Difference]: Without dead ends: 2746 [2018-12-09 05:51:34,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 05:51:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2018-12-09 05:51:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2580. [2018-12-09 05:51:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2018-12-09 05:51:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 6543 transitions. [2018-12-09 05:51:34,489 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 6543 transitions. Word has length 96 [2018-12-09 05:51:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:51:34,489 INFO L480 AbstractCegarLoop]: Abstraction has 2580 states and 6543 transitions. [2018-12-09 05:51:34,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 05:51:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 6543 transitions. [2018-12-09 05:51:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 05:51:34,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:51:34,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:51:34,491 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:51:34,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:51:34,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2137183355, now seen corresponding path program 3 times [2018-12-09 05:51:34,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:51:34,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:51:34,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:34,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:51:34,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:51:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:51:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:51:34,525 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:51:34,590 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 05:51:34,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:51:34 BasicIcfg [2018-12-09 05:51:34,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:51:34,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:51:34,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:51:34,591 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:51:34,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:51:10" (3/4) ... [2018-12-09 05:51:34,594 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 05:51:34,663 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_61564265-e4cd-434e-a1a7-0dadebe92e3a/bin-2019/uautomizer/witness.graphml [2018-12-09 05:51:34,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:51:34,664 INFO L168 Benchmark]: Toolchain (without parser) took 24421.26 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 950.6 MB in the beginning and 1.4 GB in the end (delta: -439.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-09 05:51:34,665 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:51:34,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-12-09 05:51:34,666 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:51:34,666 INFO L168 Benchmark]: Boogie Preprocessor took 20.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:51:34,666 INFO L168 Benchmark]: RCFGBuilder took 364.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-09 05:51:34,666 INFO L168 Benchmark]: TraceAbstraction took 23612.03 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -402.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-09 05:51:34,666 INFO L168 Benchmark]: Witness Printer took 72.26 ms. Allocated memory is still 3.3 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2018-12-09 05:51:34,668 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23612.03 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -402.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 72.26 ms. Allocated memory is still 3.3 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] -1 pthread_t t1105; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] -1 pthread_t t1106; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 23.5s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8885 SDtfs, 9507 SDslu, 21341 SDs, 0 SdLazy, 10048 SolverSat, 516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 96 SyntacticMatches, 22 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=5, 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: 8.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 171160 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2547 NumberOfCodeBlocks, 2547 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2419 ConstructedInterpolants, 0 QuantifiedInterpolants, 490648 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...