./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 7fedffaf166c04fa23911a87ebd562034522f75b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-2e94e6a [2018-12-31 22:45:58,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:45:58,039 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:45:58,052 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:45:58,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:45:58,053 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:45:58,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:45:58,056 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:45:58,058 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:45:58,059 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:45:58,060 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:45:58,060 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:45:58,061 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:45:58,062 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:45:58,063 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:45:58,064 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:45:58,065 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:45:58,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:45:58,069 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:45:58,071 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:45:58,072 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:45:58,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:45:58,076 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:45:58,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:45:58,077 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:45:58,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:45:58,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:45:58,080 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:45:58,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:45:58,082 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:45:58,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:45:58,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:45:58,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:45:58,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:45:58,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:45:58,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:45:58,086 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:45:58,102 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:45:58,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:45:58,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:45:58,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:45:58,104 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:45:58,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:45:58,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:45:58,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:45:58,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:45:58,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:45:58,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:45:58,106 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:45:58,106 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:45:58,106 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:45:58,106 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:45:58,106 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:45:58,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:45:58,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:45:58,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:45:58,107 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:45:58,107 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:45:58,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:45:58,108 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:45:58,108 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:45:58,108 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:45:58,108 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:45:58,108 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:45:58,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:45:58,109 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 7fedffaf166c04fa23911a87ebd562034522f75b [2018-12-31 22:45:58,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:45:58,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:45:58,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:45:58,180 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:45:58,181 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:45:58,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i [2018-12-31 22:45:58,246 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8328d88b9/e102b3d081db4d258cfc69de006f7585/FLAGe0cd96c7b [2018-12-31 22:45:58,868 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:45:58,870 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i [2018-12-31 22:45:58,893 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8328d88b9/e102b3d081db4d258cfc69de006f7585/FLAGe0cd96c7b [2018-12-31 22:45:59,045 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8328d88b9/e102b3d081db4d258cfc69de006f7585 [2018-12-31 22:45:59,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:45:59,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:45:59,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:45:59,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:45:59,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:45:59,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:45:59,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556facdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59, skipping insertion in model container [2018-12-31 22:45:59,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:45:59,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:45:59,126 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:45:59,647 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:45:59,666 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:45:59,844 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:45:59,931 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:45:59,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59 WrapperNode [2018-12-31 22:45:59,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:45:59,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:45:59,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:45:59,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:45:59,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:45:59,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:46:00,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:46:00,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:46:00,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:46:00,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:46:00,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:46:00,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:46:00,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:46:00,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:46:00,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:46:00,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:46:00,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (1/1) ... [2018-12-31 22:46:00,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:46:00,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:46:00,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:46:00,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:46:00,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-31 22:46:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:46:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:46:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:46:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:46:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:46:00,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:46:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:46:00,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:46:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:46:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:46:00,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:46:00,147 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:46:01,231 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:46:01,231 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:46:01,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:46:01 BoogieIcfgContainer [2018-12-31 22:46:01,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:46:01,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:46:01,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:46:01,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:46:01,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:45:59" (1/3) ... [2018-12-31 22:46:01,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53088a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:46:01, skipping insertion in model container [2018-12-31 22:46:01,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:59" (2/3) ... [2018-12-31 22:46:01,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53088a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:46:01, skipping insertion in model container [2018-12-31 22:46:01,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:46:01" (3/3) ... [2018-12-31 22:46:01,244 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt_false-unreach-call.i [2018-12-31 22:46:01,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,293 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,293 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,305 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,306 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,307 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,307 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,307 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:46:01,344 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:46:01,345 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:46:01,354 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:46:01,372 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:46:01,397 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:46:01,397 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:46:01,398 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:46:01,398 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:46:01,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:46:01,398 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:46:01,398 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:46:01,398 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:46:01,398 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:46:01,413 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-31 22:46:03,118 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25088 states. [2018-12-31 22:46:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 25088 states. [2018-12-31 22:46:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 22:46:03,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:03,131 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] [2018-12-31 22:46:03,134 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1172530028, now seen corresponding path program 1 times [2018-12-31 22:46:03,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:03,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:03,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:03,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:03,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:03,523 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-31 22:46:03,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:03,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:46:03,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:46:03,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:46:03,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:46:03,547 INFO L87 Difference]: Start difference. First operand 25088 states. Second operand 4 states. [2018-12-31 22:46:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:04,644 INFO L93 Difference]: Finished difference Result 45388 states and 177626 transitions. [2018-12-31 22:46:04,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:46:04,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-31 22:46:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:04,981 INFO L225 Difference]: With dead ends: 45388 [2018-12-31 22:46:04,981 INFO L226 Difference]: Without dead ends: 40628 [2018-12-31 22:46:04,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:46:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40628 states. [2018-12-31 22:46:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40628 to 23662. [2018-12-31 22:46:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23662 states. [2018-12-31 22:46:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23662 states to 23662 states and 92543 transitions. [2018-12-31 22:46:06,682 INFO L78 Accepts]: Start accepts. Automaton has 23662 states and 92543 transitions. Word has length 37 [2018-12-31 22:46:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:06,685 INFO L480 AbstractCegarLoop]: Abstraction has 23662 states and 92543 transitions. [2018-12-31 22:46:06,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:46:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23662 states and 92543 transitions. [2018-12-31 22:46:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 22:46:06,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:06,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:06,701 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:06,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1746574175, now seen corresponding path program 1 times [2018-12-31 22:46:06,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:06,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:06,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:06,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:07,072 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-31 22:46:07,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:07,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:46:07,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:46:07,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:46:07,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:46:07,078 INFO L87 Difference]: Start difference. First operand 23662 states and 92543 transitions. Second operand 5 states. [2018-12-31 22:46:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:10,220 INFO L93 Difference]: Finished difference Result 64830 states and 241369 transitions. [2018-12-31 22:46:10,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:46:10,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-31 22:46:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:10,533 INFO L225 Difference]: With dead ends: 64830 [2018-12-31 22:46:10,533 INFO L226 Difference]: Without dead ends: 64670 [2018-12-31 22:46:10,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:46:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64670 states. [2018-12-31 22:46:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64670 to 37142. [2018-12-31 22:46:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37142 states. [2018-12-31 22:46:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37142 states to 37142 states and 138284 transitions. [2018-12-31 22:46:12,240 INFO L78 Accepts]: Start accepts. Automaton has 37142 states and 138284 transitions. Word has length 44 [2018-12-31 22:46:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:12,242 INFO L480 AbstractCegarLoop]: Abstraction has 37142 states and 138284 transitions. [2018-12-31 22:46:12,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:46:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 37142 states and 138284 transitions. [2018-12-31 22:46:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 22:46:12,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:12,246 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-31 22:46:12,247 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:12,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:12,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1206649085, now seen corresponding path program 1 times [2018-12-31 22:46:12,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:12,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:12,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:12,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:12,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:12,371 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-31 22:46:12,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:12,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:46:12,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:46:12,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:46:12,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:46:12,373 INFO L87 Difference]: Start difference. First operand 37142 states and 138284 transitions. Second operand 4 states. [2018-12-31 22:46:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:12,474 INFO L93 Difference]: Finished difference Result 12364 states and 41177 transitions. [2018-12-31 22:46:12,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:46:12,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-31 22:46:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:12,503 INFO L225 Difference]: With dead ends: 12364 [2018-12-31 22:46:12,504 INFO L226 Difference]: Without dead ends: 11843 [2018-12-31 22:46:12,504 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-31 22:46:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2018-12-31 22:46:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 11843. [2018-12-31 22:46:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11843 states. [2018-12-31 22:46:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11843 states to 11843 states and 39622 transitions. [2018-12-31 22:46:12,781 INFO L78 Accepts]: Start accepts. Automaton has 11843 states and 39622 transitions. Word has length 45 [2018-12-31 22:46:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:12,782 INFO L480 AbstractCegarLoop]: Abstraction has 11843 states and 39622 transitions. [2018-12-31 22:46:12,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:46:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 11843 states and 39622 transitions. [2018-12-31 22:46:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-31 22:46:12,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:12,789 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] [2018-12-31 22:46:12,789 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:12,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:12,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1535092985, now seen corresponding path program 1 times [2018-12-31 22:46:12,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:12,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:12,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:12,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-31 22:46:12,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:12,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:46:12,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:46:12,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:46:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:46:12,999 INFO L87 Difference]: Start difference. First operand 11843 states and 39622 transitions. Second operand 4 states. [2018-12-31 22:46:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:13,383 INFO L93 Difference]: Finished difference Result 17019 states and 55693 transitions. [2018-12-31 22:46:13,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:46:13,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-31 22:46:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:13,414 INFO L225 Difference]: With dead ends: 17019 [2018-12-31 22:46:13,415 INFO L226 Difference]: Without dead ends: 17019 [2018-12-31 22:46:13,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:46:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2018-12-31 22:46:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 12879. [2018-12-31 22:46:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12879 states. [2018-12-31 22:46:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12879 states to 12879 states and 42720 transitions. [2018-12-31 22:46:13,713 INFO L78 Accepts]: Start accepts. Automaton has 12879 states and 42720 transitions. Word has length 58 [2018-12-31 22:46:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:13,714 INFO L480 AbstractCegarLoop]: Abstraction has 12879 states and 42720 transitions. [2018-12-31 22:46:13,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:46:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 12879 states and 42720 transitions. [2018-12-31 22:46:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-31 22:46:13,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:13,721 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] [2018-12-31 22:46:13,722 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash -986044169, now seen corresponding path program 1 times [2018-12-31 22:46:13,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:13,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:13,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:13,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:13,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:13,928 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-31 22:46:13,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:13,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:46:13,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:46:13,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:46:13,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:46:13,930 INFO L87 Difference]: Start difference. First operand 12879 states and 42720 transitions. Second operand 6 states. [2018-12-31 22:46:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:15,265 INFO L93 Difference]: Finished difference Result 18599 states and 60830 transitions. [2018-12-31 22:46:15,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:46:15,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-31 22:46:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:15,304 INFO L225 Difference]: With dead ends: 18599 [2018-12-31 22:46:15,304 INFO L226 Difference]: Without dead ends: 18567 [2018-12-31 22:46:15,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:46:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18567 states. [2018-12-31 22:46:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18567 to 14411. [2018-12-31 22:46:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14411 states. [2018-12-31 22:46:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14411 states to 14411 states and 47549 transitions. [2018-12-31 22:46:15,565 INFO L78 Accepts]: Start accepts. Automaton has 14411 states and 47549 transitions. Word has length 58 [2018-12-31 22:46:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:15,565 INFO L480 AbstractCegarLoop]: Abstraction has 14411 states and 47549 transitions. [2018-12-31 22:46:15,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:46:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14411 states and 47549 transitions. [2018-12-31 22:46:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 22:46:15,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:15,594 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] [2018-12-31 22:46:15,595 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2012561834, now seen corresponding path program 1 times [2018-12-31 22:46:15,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:15,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:15,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:15,936 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-31 22:46:15,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:15,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:46:15,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:46:15,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:46:15,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:15,937 INFO L87 Difference]: Start difference. First operand 14411 states and 47549 transitions. Second operand 7 states. [2018-12-31 22:46:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:16,959 INFO L93 Difference]: Finished difference Result 19527 states and 63626 transitions. [2018-12-31 22:46:16,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 22:46:16,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-31 22:46:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:17,003 INFO L225 Difference]: With dead ends: 19527 [2018-12-31 22:46:17,003 INFO L226 Difference]: Without dead ends: 19463 [2018-12-31 22:46:17,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-31 22:46:17,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19463 states. [2018-12-31 22:46:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19463 to 16195. [2018-12-31 22:46:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16195 states. [2018-12-31 22:46:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16195 states to 16195 states and 53059 transitions. [2018-12-31 22:46:17,328 INFO L78 Accepts]: Start accepts. Automaton has 16195 states and 53059 transitions. Word has length 72 [2018-12-31 22:46:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:17,329 INFO L480 AbstractCegarLoop]: Abstraction has 16195 states and 53059 transitions. [2018-12-31 22:46:17,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:46:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 16195 states and 53059 transitions. [2018-12-31 22:46:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-31 22:46:17,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:17,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:17,353 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:17,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:17,353 INFO L82 PathProgramCache]: Analyzing trace with hash -351525462, now seen corresponding path program 1 times [2018-12-31 22:46:17,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:17,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:17,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:17,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:17,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:17,438 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-31 22:46:17,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:17,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:46:17,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:46:17,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:46:17,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:46:17,439 INFO L87 Difference]: Start difference. First operand 16195 states and 53059 transitions. Second operand 3 states. [2018-12-31 22:46:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:17,551 INFO L93 Difference]: Finished difference Result 19283 states and 62127 transitions. [2018-12-31 22:46:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:46:17,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-31 22:46:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:17,585 INFO L225 Difference]: With dead ends: 19283 [2018-12-31 22:46:17,585 INFO L226 Difference]: Without dead ends: 19283 [2018-12-31 22:46:17,585 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-31 22:46:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19283 states. [2018-12-31 22:46:18,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19283 to 17291. [2018-12-31 22:46:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17291 states. [2018-12-31 22:46:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17291 states to 17291 states and 56209 transitions. [2018-12-31 22:46:18,217 INFO L78 Accepts]: Start accepts. Automaton has 17291 states and 56209 transitions. Word has length 74 [2018-12-31 22:46:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:18,218 INFO L480 AbstractCegarLoop]: Abstraction has 17291 states and 56209 transitions. [2018-12-31 22:46:18,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:46:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 17291 states and 56209 transitions. [2018-12-31 22:46:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-31 22:46:18,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:18,238 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] [2018-12-31 22:46:18,239 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:18,239 INFO L82 PathProgramCache]: Analyzing trace with hash 610734480, now seen corresponding path program 1 times [2018-12-31 22:46:18,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:18,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:18,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:18,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:18,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:18,681 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-31 22:46:18,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:18,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:46:18,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:46:18,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:46:18,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:46:18,683 INFO L87 Difference]: Start difference. First operand 17291 states and 56209 transitions. Second operand 10 states. [2018-12-31 22:46:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:21,258 INFO L93 Difference]: Finished difference Result 25447 states and 79950 transitions. [2018-12-31 22:46:21,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-31 22:46:21,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-31 22:46:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:21,303 INFO L225 Difference]: With dead ends: 25447 [2018-12-31 22:46:21,303 INFO L226 Difference]: Without dead ends: 25383 [2018-12-31 22:46:21,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2018-12-31 22:46:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25383 states. [2018-12-31 22:46:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25383 to 19359. [2018-12-31 22:46:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19359 states. [2018-12-31 22:46:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19359 states to 19359 states and 62260 transitions. [2018-12-31 22:46:21,647 INFO L78 Accepts]: Start accepts. Automaton has 19359 states and 62260 transitions. Word has length 78 [2018-12-31 22:46:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:21,648 INFO L480 AbstractCegarLoop]: Abstraction has 19359 states and 62260 transitions. [2018-12-31 22:46:21,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:46:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 19359 states and 62260 transitions. [2018-12-31 22:46:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-31 22:46:21,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:21,672 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-31 22:46:21,672 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:21,672 INFO L82 PathProgramCache]: Analyzing trace with hash -676930281, now seen corresponding path program 1 times [2018-12-31 22:46:21,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:21,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:21,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:21,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:21,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:21,782 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-31 22:46:21,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:21,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:46:21,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:46:21,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:46:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:46:21,783 INFO L87 Difference]: Start difference. First operand 19359 states and 62260 transitions. Second operand 3 states. [2018-12-31 22:46:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:22,074 INFO L93 Difference]: Finished difference Result 20621 states and 66127 transitions. [2018-12-31 22:46:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:46:22,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-12-31 22:46:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:22,109 INFO L225 Difference]: With dead ends: 20621 [2018-12-31 22:46:22,110 INFO L226 Difference]: Without dead ends: 20621 [2018-12-31 22:46:22,110 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-31 22:46:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20621 states. [2018-12-31 22:46:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20621 to 19971. [2018-12-31 22:46:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19971 states. [2018-12-31 22:46:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19971 states to 19971 states and 64142 transitions. [2018-12-31 22:46:22,444 INFO L78 Accepts]: Start accepts. Automaton has 19971 states and 64142 transitions. Word has length 79 [2018-12-31 22:46:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:22,444 INFO L480 AbstractCegarLoop]: Abstraction has 19971 states and 64142 transitions. [2018-12-31 22:46:22,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:46:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 19971 states and 64142 transitions. [2018-12-31 22:46:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-31 22:46:22,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:22,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:22,473 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:22,474 INFO L82 PathProgramCache]: Analyzing trace with hash -34557090, now seen corresponding path program 1 times [2018-12-31 22:46:22,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:22,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:22,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:22,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:46:22,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:22,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:46:22,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:46:22,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:46:22,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:46:22,623 INFO L87 Difference]: Start difference. First operand 19971 states and 64142 transitions. Second operand 4 states. [2018-12-31 22:46:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:23,296 INFO L93 Difference]: Finished difference Result 24353 states and 77144 transitions. [2018-12-31 22:46:23,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:46:23,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-31 22:46:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:23,347 INFO L225 Difference]: With dead ends: 24353 [2018-12-31 22:46:23,347 INFO L226 Difference]: Without dead ends: 24353 [2018-12-31 22:46:23,348 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-31 22:46:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24353 states. [2018-12-31 22:46:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24353 to 22837. [2018-12-31 22:46:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22837 states. [2018-12-31 22:46:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22837 states to 22837 states and 72763 transitions. [2018-12-31 22:46:23,826 INFO L78 Accepts]: Start accepts. Automaton has 22837 states and 72763 transitions. Word has length 80 [2018-12-31 22:46:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:23,827 INFO L480 AbstractCegarLoop]: Abstraction has 22837 states and 72763 transitions. [2018-12-31 22:46:23,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:46:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 22837 states and 72763 transitions. [2018-12-31 22:46:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-31 22:46:23,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:23,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:23,854 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1970217377, now seen corresponding path program 1 times [2018-12-31 22:46:23,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:23,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:23,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:23,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:23,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:46:23,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:23,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:46:23,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:46:23,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:46:23,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:46:23,996 INFO L87 Difference]: Start difference. First operand 22837 states and 72763 transitions. Second operand 3 states. [2018-12-31 22:46:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:25,028 INFO L93 Difference]: Finished difference Result 24179 states and 76859 transitions. [2018-12-31 22:46:25,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:46:25,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-31 22:46:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:25,077 INFO L225 Difference]: With dead ends: 24179 [2018-12-31 22:46:25,077 INFO L226 Difference]: Without dead ends: 24179 [2018-12-31 22:46:25,078 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-31 22:46:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24179 states. [2018-12-31 22:46:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24179 to 23519. [2018-12-31 22:46:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23519 states. [2018-12-31 22:46:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23519 states to 23519 states and 74839 transitions. [2018-12-31 22:46:25,445 INFO L78 Accepts]: Start accepts. Automaton has 23519 states and 74839 transitions. Word has length 80 [2018-12-31 22:46:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:25,445 INFO L480 AbstractCegarLoop]: Abstraction has 23519 states and 74839 transitions. [2018-12-31 22:46:25,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:46:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 23519 states and 74839 transitions. [2018-12-31 22:46:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 22:46:25,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:25,468 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-31 22:46:25,469 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:25,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash 217933573, now seen corresponding path program 1 times [2018-12-31 22:46:25,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:25,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:25,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:25,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:25,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:25,650 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-31 22:46:25,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:25,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:46:25,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:46:25,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:46:25,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:46:25,652 INFO L87 Difference]: Start difference. First operand 23519 states and 74839 transitions. Second operand 5 states. [2018-12-31 22:46:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:26,873 INFO L93 Difference]: Finished difference Result 55998 states and 175087 transitions. [2018-12-31 22:46:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:46:26,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-31 22:46:26,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:26,975 INFO L225 Difference]: With dead ends: 55998 [2018-12-31 22:46:26,975 INFO L226 Difference]: Without dead ends: 55998 [2018-12-31 22:46:26,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:46:27,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55998 states. [2018-12-31 22:46:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55998 to 28501. [2018-12-31 22:46:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28501 states. [2018-12-31 22:46:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28501 states to 28501 states and 91285 transitions. [2018-12-31 22:46:27,520 INFO L78 Accepts]: Start accepts. Automaton has 28501 states and 91285 transitions. Word has length 81 [2018-12-31 22:46:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:27,520 INFO L480 AbstractCegarLoop]: Abstraction has 28501 states and 91285 transitions. [2018-12-31 22:46:27,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:46:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 28501 states and 91285 transitions. [2018-12-31 22:46:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 22:46:27,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:27,550 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-31 22:46:27,551 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:27,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:27,552 INFO L82 PathProgramCache]: Analyzing trace with hash -111832188, now seen corresponding path program 1 times [2018-12-31 22:46:27,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:27,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:27,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:27,753 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-31 22:46:27,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:27,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:46:27,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:46:27,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:46:27,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:46:27,755 INFO L87 Difference]: Start difference. First operand 28501 states and 91285 transitions. Second operand 6 states. [2018-12-31 22:46:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:28,792 INFO L93 Difference]: Finished difference Result 51217 states and 160214 transitions. [2018-12-31 22:46:28,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:46:28,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-31 22:46:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:28,895 INFO L225 Difference]: With dead ends: 51217 [2018-12-31 22:46:28,895 INFO L226 Difference]: Without dead ends: 49953 [2018-12-31 22:46:28,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:46:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49953 states. [2018-12-31 22:46:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49953 to 39661. [2018-12-31 22:46:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39661 states. [2018-12-31 22:46:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39661 states to 39661 states and 126611 transitions. [2018-12-31 22:46:29,843 INFO L78 Accepts]: Start accepts. Automaton has 39661 states and 126611 transitions. Word has length 81 [2018-12-31 22:46:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:29,844 INFO L480 AbstractCegarLoop]: Abstraction has 39661 states and 126611 transitions. [2018-12-31 22:46:29,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:46:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 39661 states and 126611 transitions. [2018-12-31 22:46:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 22:46:29,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:29,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:29,893 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:29,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash 849781829, now seen corresponding path program 1 times [2018-12-31 22:46:29,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:29,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:29,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:29,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:30,061 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-31 22:46:30,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:30,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:46:30,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:46:30,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:46:30,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:30,063 INFO L87 Difference]: Start difference. First operand 39661 states and 126611 transitions. Second operand 7 states. [2018-12-31 22:46:31,494 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-31 22:46:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:32,570 INFO L93 Difference]: Finished difference Result 64885 states and 198772 transitions. [2018-12-31 22:46:32,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 22:46:32,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-12-31 22:46:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:32,681 INFO L225 Difference]: With dead ends: 64885 [2018-12-31 22:46:32,681 INFO L226 Difference]: Without dead ends: 64773 [2018-12-31 22:46:32,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-12-31 22:46:32,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64773 states. [2018-12-31 22:46:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64773 to 39776. [2018-12-31 22:46:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39776 states. [2018-12-31 22:46:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39776 states to 39776 states and 123995 transitions. [2018-12-31 22:46:33,381 INFO L78 Accepts]: Start accepts. Automaton has 39776 states and 123995 transitions. Word has length 81 [2018-12-31 22:46:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:33,382 INFO L480 AbstractCegarLoop]: Abstraction has 39776 states and 123995 transitions. [2018-12-31 22:46:33,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:46:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 39776 states and 123995 transitions. [2018-12-31 22:46:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 22:46:33,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:33,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:33,414 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:33,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1574202429, now seen corresponding path program 2 times [2018-12-31 22:46:33,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:33,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:33,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:33,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:33,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:33,662 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 22:46:33,719 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-31 22:46:33,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:33,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:46:33,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:46:33,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:46:33,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:46:33,722 INFO L87 Difference]: Start difference. First operand 39776 states and 123995 transitions. Second operand 6 states. [2018-12-31 22:46:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:34,585 INFO L93 Difference]: Finished difference Result 58816 states and 182231 transitions. [2018-12-31 22:46:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:46:34,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-31 22:46:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:34,694 INFO L225 Difference]: With dead ends: 58816 [2018-12-31 22:46:34,694 INFO L226 Difference]: Without dead ends: 58816 [2018-12-31 22:46:34,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:46:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58816 states. [2018-12-31 22:46:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58816 to 43484. [2018-12-31 22:46:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43484 states. [2018-12-31 22:46:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43484 states to 43484 states and 135064 transitions. [2018-12-31 22:46:35,486 INFO L78 Accepts]: Start accepts. Automaton has 43484 states and 135064 transitions. Word has length 81 [2018-12-31 22:46:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:35,486 INFO L480 AbstractCegarLoop]: Abstraction has 43484 states and 135064 transitions. [2018-12-31 22:46:35,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:46:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 43484 states and 135064 transitions. [2018-12-31 22:46:35,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 22:46:35,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:35,528 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-31 22:46:35,529 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:35,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:35,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1476000386, now seen corresponding path program 1 times [2018-12-31 22:46:35,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:35,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:35,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:35,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:46:35,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:35,851 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-31 22:46:35,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:35,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:46:35,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:46:35,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:46:35,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:35,853 INFO L87 Difference]: Start difference. First operand 43484 states and 135064 transitions. Second operand 7 states. [2018-12-31 22:46:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:37,474 INFO L93 Difference]: Finished difference Result 53488 states and 164527 transitions. [2018-12-31 22:46:37,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:46:37,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-12-31 22:46:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:37,559 INFO L225 Difference]: With dead ends: 53488 [2018-12-31 22:46:37,559 INFO L226 Difference]: Without dead ends: 52872 [2018-12-31 22:46:37,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:46:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52872 states. [2018-12-31 22:46:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52872 to 42203. [2018-12-31 22:46:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42203 states. [2018-12-31 22:46:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42203 states to 42203 states and 131430 transitions. [2018-12-31 22:46:38,194 INFO L78 Accepts]: Start accepts. Automaton has 42203 states and 131430 transitions. Word has length 81 [2018-12-31 22:46:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:38,195 INFO L480 AbstractCegarLoop]: Abstraction has 42203 states and 131430 transitions. [2018-12-31 22:46:38,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:46:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 42203 states and 131430 transitions. [2018-12-31 22:46:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 22:46:38,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:38,228 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-31 22:46:38,229 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:38,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:38,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2033769469, now seen corresponding path program 1 times [2018-12-31 22:46:38,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:38,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:38,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:38,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:38,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:38,361 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-31 22:46:38,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:38,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:46:38,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:46:38,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:46:38,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:38,363 INFO L87 Difference]: Start difference. First operand 42203 states and 131430 transitions. Second operand 7 states. [2018-12-31 22:46:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:39,623 INFO L93 Difference]: Finished difference Result 77506 states and 237207 transitions. [2018-12-31 22:46:39,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:46:39,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-12-31 22:46:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:39,743 INFO L225 Difference]: With dead ends: 77506 [2018-12-31 22:46:39,743 INFO L226 Difference]: Without dead ends: 76650 [2018-12-31 22:46:39,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:46:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76650 states. [2018-12-31 22:46:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76650 to 42136. [2018-12-31 22:46:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42136 states. [2018-12-31 22:46:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42136 states to 42136 states and 131261 transitions. [2018-12-31 22:46:40,488 INFO L78 Accepts]: Start accepts. Automaton has 42136 states and 131261 transitions. Word has length 81 [2018-12-31 22:46:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:40,488 INFO L480 AbstractCegarLoop]: Abstraction has 42136 states and 131261 transitions. [2018-12-31 22:46:40,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:46:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 42136 states and 131261 transitions. [2018-12-31 22:46:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 22:46:40,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:40,528 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-31 22:46:40,528 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:40,529 INFO L82 PathProgramCache]: Analyzing trace with hash 149471869, now seen corresponding path program 1 times [2018-12-31 22:46:40,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:40,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:40,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:40,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:40,840 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-31 22:46:40,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:40,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:46:40,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:46:40,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:46:40,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:46:40,841 INFO L87 Difference]: Start difference. First operand 42136 states and 131261 transitions. Second operand 8 states. [2018-12-31 22:46:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:42,680 INFO L93 Difference]: Finished difference Result 63307 states and 191899 transitions. [2018-12-31 22:46:42,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 22:46:42,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-12-31 22:46:42,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:42,776 INFO L225 Difference]: With dead ends: 63307 [2018-12-31 22:46:42,777 INFO L226 Difference]: Without dead ends: 62455 [2018-12-31 22:46:42,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-12-31 22:46:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62455 states. [2018-12-31 22:46:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62455 to 41419. [2018-12-31 22:46:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41419 states. [2018-12-31 22:46:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41419 states to 41419 states and 128481 transitions. [2018-12-31 22:46:43,840 INFO L78 Accepts]: Start accepts. Automaton has 41419 states and 128481 transitions. Word has length 81 [2018-12-31 22:46:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:43,840 INFO L480 AbstractCegarLoop]: Abstraction has 41419 states and 128481 transitions. [2018-12-31 22:46:43,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:46:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 41419 states and 128481 transitions. [2018-12-31 22:46:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 22:46:43,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:43,875 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-31 22:46:43,875 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:43,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1111085886, now seen corresponding path program 1 times [2018-12-31 22:46:43,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:43,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:43,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:44,112 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-31 22:46:44,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:44,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:46:44,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:46:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:46:44,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:46:44,115 INFO L87 Difference]: Start difference. First operand 41419 states and 128481 transitions. Second operand 5 states. [2018-12-31 22:46:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:44,263 INFO L93 Difference]: Finished difference Result 5447 states and 13942 transitions. [2018-12-31 22:46:44,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:46:44,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-31 22:46:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:44,270 INFO L225 Difference]: With dead ends: 5447 [2018-12-31 22:46:44,270 INFO L226 Difference]: Without dead ends: 4629 [2018-12-31 22:46:44,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2018-12-31 22:46:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4234. [2018-12-31 22:46:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4234 states. [2018-12-31 22:46:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 10952 transitions. [2018-12-31 22:46:44,321 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 10952 transitions. Word has length 81 [2018-12-31 22:46:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:44,321 INFO L480 AbstractCegarLoop]: Abstraction has 4234 states and 10952 transitions. [2018-12-31 22:46:44,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:46:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 10952 transitions. [2018-12-31 22:46:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:46:44,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:44,327 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] [2018-12-31 22:46:44,327 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:44,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1103086994, now seen corresponding path program 1 times [2018-12-31 22:46:44,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:44,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:44,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:44,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:44,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:44,698 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-31 22:46:44,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:44,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:46:44,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:46:44,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:46:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:46:44,700 INFO L87 Difference]: Start difference. First operand 4234 states and 10952 transitions. Second operand 5 states. [2018-12-31 22:46:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:44,941 INFO L93 Difference]: Finished difference Result 5421 states and 13801 transitions. [2018-12-31 22:46:44,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:46:44,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-31 22:46:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:44,950 INFO L225 Difference]: With dead ends: 5421 [2018-12-31 22:46:44,950 INFO L226 Difference]: Without dead ends: 5421 [2018-12-31 22:46:44,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:46:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2018-12-31 22:46:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 4317. [2018-12-31 22:46:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2018-12-31 22:46:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 11119 transitions. [2018-12-31 22:46:45,000 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 11119 transitions. Word has length 93 [2018-12-31 22:46:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:45,001 INFO L480 AbstractCegarLoop]: Abstraction has 4317 states and 11119 transitions. [2018-12-31 22:46:45,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:46:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 11119 transitions. [2018-12-31 22:46:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:46:45,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:45,005 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] [2018-12-31 22:46:45,006 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:45,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash -340327769, now seen corresponding path program 1 times [2018-12-31 22:46:45,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:45,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:45,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:45,154 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-31 22:46:45,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:45,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:46:45,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:46:45,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:46:45,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:45,156 INFO L87 Difference]: Start difference. First operand 4317 states and 11119 transitions. Second operand 7 states. [2018-12-31 22:46:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:45,489 INFO L93 Difference]: Finished difference Result 4718 states and 12062 transitions. [2018-12-31 22:46:45,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:46:45,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 22:46:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:45,496 INFO L225 Difference]: With dead ends: 4718 [2018-12-31 22:46:45,496 INFO L226 Difference]: Without dead ends: 4718 [2018-12-31 22:46:45,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2018-12-31 22:46:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4442. [2018-12-31 22:46:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4442 states. [2018-12-31 22:46:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 11391 transitions. [2018-12-31 22:46:45,544 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 11391 transitions. Word has length 93 [2018-12-31 22:46:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:45,544 INFO L480 AbstractCegarLoop]: Abstraction has 4442 states and 11391 transitions. [2018-12-31 22:46:45,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:46:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 11391 transitions. [2018-12-31 22:46:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:46:45,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:45,549 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] [2018-12-31 22:46:45,549 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1523675066, now seen corresponding path program 1 times [2018-12-31 22:46:45,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:45,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:45,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:45,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:45,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:45,872 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-31 22:46:45,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:45,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:46:45,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:46:45,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:46:45,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:46:45,874 INFO L87 Difference]: Start difference. First operand 4442 states and 11391 transitions. Second operand 5 states. [2018-12-31 22:46:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:46,006 INFO L93 Difference]: Finished difference Result 4357 states and 11139 transitions. [2018-12-31 22:46:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:46:46,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-31 22:46:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:46,013 INFO L225 Difference]: With dead ends: 4357 [2018-12-31 22:46:46,013 INFO L226 Difference]: Without dead ends: 4357 [2018-12-31 22:46:46,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:46:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2018-12-31 22:46:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 4316. [2018-12-31 22:46:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4316 states. [2018-12-31 22:46:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4316 states to 4316 states and 11052 transitions. [2018-12-31 22:46:46,055 INFO L78 Accepts]: Start accepts. Automaton has 4316 states and 11052 transitions. Word has length 93 [2018-12-31 22:46:46,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:46,055 INFO L480 AbstractCegarLoop]: Abstraction has 4316 states and 11052 transitions. [2018-12-31 22:46:46,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:46:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4316 states and 11052 transitions. [2018-12-31 22:46:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 22:46:46,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:46,061 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] [2018-12-31 22:46:46,061 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:46,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:46,061 INFO L82 PathProgramCache]: Analyzing trace with hash -125982074, now seen corresponding path program 1 times [2018-12-31 22:46:46,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:46,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:46,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:46,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:46,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:46,288 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-31 22:46:46,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:46,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:46:46,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:46:46,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:46:46,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:46:46,290 INFO L87 Difference]: Start difference. First operand 4316 states and 11052 transitions. Second operand 6 states. [2018-12-31 22:46:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:46,488 INFO L93 Difference]: Finished difference Result 4028 states and 10044 transitions. [2018-12-31 22:46:46,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:46:46,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-31 22:46:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:46,495 INFO L225 Difference]: With dead ends: 4028 [2018-12-31 22:46:46,495 INFO L226 Difference]: Without dead ends: 4028 [2018-12-31 22:46:46,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:46,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2018-12-31 22:46:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 2988. [2018-12-31 22:46:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2018-12-31 22:46:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 7539 transitions. [2018-12-31 22:46:46,533 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 7539 transitions. Word has length 93 [2018-12-31 22:46:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:46,533 INFO L480 AbstractCegarLoop]: Abstraction has 2988 states and 7539 transitions. [2018-12-31 22:46:46,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:46:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 7539 transitions. [2018-12-31 22:46:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:46:46,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:46,537 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] [2018-12-31 22:46:46,537 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:46,537 INFO L82 PathProgramCache]: Analyzing trace with hash 153060183, now seen corresponding path program 1 times [2018-12-31 22:46:46,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:46,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:46,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:46,801 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-31 22:46:46,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:46,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:46:46,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:46:46,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:46:46,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:46:46,802 INFO L87 Difference]: Start difference. First operand 2988 states and 7539 transitions. Second operand 8 states. [2018-12-31 22:46:47,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:47,410 INFO L93 Difference]: Finished difference Result 4724 states and 11574 transitions. [2018-12-31 22:46:47,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 22:46:47,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-31 22:46:47,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:47,417 INFO L225 Difference]: With dead ends: 4724 [2018-12-31 22:46:47,417 INFO L226 Difference]: Without dead ends: 4692 [2018-12-31 22:46:47,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-31 22:46:47,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2018-12-31 22:46:47,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 3656. [2018-12-31 22:46:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3656 states. [2018-12-31 22:46:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 9134 transitions. [2018-12-31 22:46:47,457 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 9134 transitions. Word has length 95 [2018-12-31 22:46:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:47,458 INFO L480 AbstractCegarLoop]: Abstraction has 3656 states and 9134 transitions. [2018-12-31 22:46:47,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:46:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 9134 transitions. [2018-12-31 22:46:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:46:47,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:47,461 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] [2018-12-31 22:46:47,462 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:47,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:47,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1397824664, now seen corresponding path program 1 times [2018-12-31 22:46:47,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:47,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:47,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:47,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:47,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:48,301 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 22:46:48,429 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-31 22:46:48,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:48,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:46:48,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:46:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:46:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:46:48,430 INFO L87 Difference]: Start difference. First operand 3656 states and 9134 transitions. Second operand 8 states. [2018-12-31 22:46:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:49,292 INFO L93 Difference]: Finished difference Result 4805 states and 11811 transitions. [2018-12-31 22:46:49,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-31 22:46:49,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-31 22:46:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:49,299 INFO L225 Difference]: With dead ends: 4805 [2018-12-31 22:46:49,299 INFO L226 Difference]: Without dead ends: 4751 [2018-12-31 22:46:49,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-12-31 22:46:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4751 states. [2018-12-31 22:46:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4751 to 3617. [2018-12-31 22:46:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3617 states. [2018-12-31 22:46:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 9016 transitions. [2018-12-31 22:46:49,341 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 9016 transitions. Word has length 95 [2018-12-31 22:46:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:49,341 INFO L480 AbstractCegarLoop]: Abstraction has 3617 states and 9016 transitions. [2018-12-31 22:46:49,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:46:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 9016 transitions. [2018-12-31 22:46:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:46:49,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:49,345 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] [2018-12-31 22:46:49,345 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:49,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:49,345 INFO L82 PathProgramCache]: Analyzing trace with hash -537835623, now seen corresponding path program 1 times [2018-12-31 22:46:49,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:49,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:49,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:49,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:49,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:49,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-31 22:46:49,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:49,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:46:49,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:46:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:46:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:49,594 INFO L87 Difference]: Start difference. First operand 3617 states and 9016 transitions. Second operand 7 states. [2018-12-31 22:46:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:49,925 INFO L93 Difference]: Finished difference Result 4493 states and 11080 transitions. [2018-12-31 22:46:49,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:46:49,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 22:46:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:49,932 INFO L225 Difference]: With dead ends: 4493 [2018-12-31 22:46:49,933 INFO L226 Difference]: Without dead ends: 4493 [2018-12-31 22:46:49,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:46:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2018-12-31 22:46:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 3702. [2018-12-31 22:46:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3702 states. [2018-12-31 22:46:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 9179 transitions. [2018-12-31 22:46:49,973 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 9179 transitions. Word has length 95 [2018-12-31 22:46:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:49,974 INFO L480 AbstractCegarLoop]: Abstraction has 3702 states and 9179 transitions. [2018-12-31 22:46:49,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:46:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 9179 transitions. [2018-12-31 22:46:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:46:49,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:49,977 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] [2018-12-31 22:46:49,978 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:49,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:49,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1452834343, now seen corresponding path program 1 times [2018-12-31 22:46:49,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:49,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:49,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:49,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:49,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:50,359 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-31 22:46:50,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:50,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:46:50,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:46:50,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:46:50,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:46:50,361 INFO L87 Difference]: Start difference. First operand 3702 states and 9179 transitions. Second operand 5 states. [2018-12-31 22:46:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:50,974 INFO L93 Difference]: Finished difference Result 4150 states and 10283 transitions. [2018-12-31 22:46:50,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:46:50,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-31 22:46:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:50,980 INFO L225 Difference]: With dead ends: 4150 [2018-12-31 22:46:50,980 INFO L226 Difference]: Without dead ends: 4118 [2018-12-31 22:46:50,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2018-12-31 22:46:51,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 3098. [2018-12-31 22:46:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-12-31 22:46:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 7705 transitions. [2018-12-31 22:46:51,016 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 7705 transitions. Word has length 95 [2018-12-31 22:46:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:51,016 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 7705 transitions. [2018-12-31 22:46:51,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:46:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 7705 transitions. [2018-12-31 22:46:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:46:51,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:51,019 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] [2018-12-31 22:46:51,020 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:51,020 INFO L82 PathProgramCache]: Analyzing trace with hash -208069862, now seen corresponding path program 1 times [2018-12-31 22:46:51,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:51,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:51,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:51,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:51,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:51,526 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 6 [2018-12-31 22:46:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:46:51,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:51,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:46:51,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:46:51,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:46:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:46:51,621 INFO L87 Difference]: Start difference. First operand 3098 states and 7705 transitions. Second operand 5 states. [2018-12-31 22:46:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:52,031 INFO L93 Difference]: Finished difference Result 4653 states and 11967 transitions. [2018-12-31 22:46:52,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:46:52,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-31 22:46:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:52,041 INFO L225 Difference]: With dead ends: 4653 [2018-12-31 22:46:52,041 INFO L226 Difference]: Without dead ends: 4653 [2018-12-31 22:46:52,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:46:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2018-12-31 22:46:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 2963. [2018-12-31 22:46:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2963 states. [2018-12-31 22:46:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 7418 transitions. [2018-12-31 22:46:52,096 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 7418 transitions. Word has length 95 [2018-12-31 22:46:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:52,096 INFO L480 AbstractCegarLoop]: Abstraction has 2963 states and 7418 transitions. [2018-12-31 22:46:52,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:46:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 7418 transitions. [2018-12-31 22:46:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:46:52,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:52,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:46:52,103 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:52,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:52,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1433103834, now seen corresponding path program 1 times [2018-12-31 22:46:52,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:52,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:52,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:52,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:52,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:52,561 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-31 22:46:52,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:52,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:46:52,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:46:52,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:46:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:46:52,563 INFO L87 Difference]: Start difference. First operand 2963 states and 7418 transitions. Second operand 6 states. [2018-12-31 22:46:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:52,699 INFO L93 Difference]: Finished difference Result 3184 states and 7840 transitions. [2018-12-31 22:46:52,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:46:52,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-31 22:46:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:52,704 INFO L225 Difference]: With dead ends: 3184 [2018-12-31 22:46:52,704 INFO L226 Difference]: Without dead ends: 3184 [2018-12-31 22:46:52,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:46:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2018-12-31 22:46:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2992. [2018-12-31 22:46:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2992 states. [2018-12-31 22:46:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 7474 transitions. [2018-12-31 22:46:52,735 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 7474 transitions. Word has length 95 [2018-12-31 22:46:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:52,735 INFO L480 AbstractCegarLoop]: Abstraction has 2992 states and 7474 transitions. [2018-12-31 22:46:52,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:46:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 7474 transitions. [2018-12-31 22:46:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:46:52,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:52,738 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] [2018-12-31 22:46:52,739 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:52,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:52,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1762869595, now seen corresponding path program 1 times [2018-12-31 22:46:52,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:52,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:52,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:52,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:52,967 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-31 22:46:52,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:52,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:46:52,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:46:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:46:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:52,969 INFO L87 Difference]: Start difference. First operand 2992 states and 7474 transitions. Second operand 7 states. [2018-12-31 22:46:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:53,306 INFO L93 Difference]: Finished difference Result 5079 states and 12845 transitions. [2018-12-31 22:46:53,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:46:53,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 22:46:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:53,311 INFO L225 Difference]: With dead ends: 5079 [2018-12-31 22:46:53,311 INFO L226 Difference]: Without dead ends: 2072 [2018-12-31 22:46:53,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:46:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2018-12-31 22:46:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2018-12-31 22:46:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-12-31 22:46:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 5323 transitions. [2018-12-31 22:46:53,334 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 5323 transitions. Word has length 95 [2018-12-31 22:46:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:53,335 INFO L480 AbstractCegarLoop]: Abstraction has 2072 states and 5323 transitions. [2018-12-31 22:46:53,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:46:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 5323 transitions. [2018-12-31 22:46:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 22:46:53,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:53,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:53,338 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:53,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1809124577, now seen corresponding path program 2 times [2018-12-31 22:46:53,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:53,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:53,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:46:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:46:53,441 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:46:53,614 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:46:53,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:46:53 BasicIcfg [2018-12-31 22:46:53,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:46:53,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:46:53,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:46:53,621 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:46:53,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:46:01" (3/4) ... [2018-12-31 22:46:53,627 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:46:53,815 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:46:53,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:46:53,816 INFO L168 Benchmark]: Toolchain (without parser) took 54765.78 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 948.7 MB in the beginning and 1.5 GB in the end (delta: -579.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-31 22:46:53,818 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:46:53,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-12-31 22:46:53,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:46:53,819 INFO L168 Benchmark]: Boogie Preprocessor took 40.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:46:53,819 INFO L168 Benchmark]: RCFGBuilder took 1169.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-12-31 22:46:53,819 INFO L168 Benchmark]: TraceAbstraction took 52387.75 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -518.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-31 22:46:53,823 INFO L168 Benchmark]: Witness Printer took 194.09 ms. Allocated memory is still 3.9 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2018-12-31 22:46:53,826 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.64 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 879.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1169.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52387.75 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -518.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 194.09 ms. Allocated memory is still 3.9 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 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] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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 _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] [L763] -1 pthread_t t1593; 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] [L764] FCALL, FORK -1 pthread_create(&t1593, ((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] [L765] -1 pthread_t t1594; 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] [L766] FCALL, FORK -1 pthread_create(&t1594, ((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] [L721] 0 x$w_buff1 = x$w_buff0 [L722] 0 x$w_buff0 = 2 [L723] 0 x$w_buff1_used = x$w_buff0_used [L724] 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] [L726] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L727] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L728] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L729] 0 x$r_buff0_thd2 = (_Bool)1 [L732] 0 y = 1 [L735] 0 __unbuffered_p1_EAX = y [L738] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L701] 1 y = 2 [L704] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L707] 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=1, 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=2] [L707] 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=1, 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, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] 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=1, 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_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] 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) [L708] 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=1, 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_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L708] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L709] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_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=2] [L709] 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 [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L711] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_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=2] [L711] 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 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L741] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L741] 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) [L742] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L742] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L743] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L743] 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 [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L744] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L745] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L745] 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 [L748] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L768] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=2] [L772] 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=1, 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=2] [L772] 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=1, 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=2] [L772] 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=1, 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=2] [L772] -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) [L773] 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=1, 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=2] [L773] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L774] 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=1, 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=2] [L774] -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 [L775] 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=1, 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=2] [L775] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L776] 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=1, 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=2] [L776] -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 [L779] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L780] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L781] -1 x$flush_delayed = weak$$choice2 [L782] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L783] 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=1, 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=2] [L783] -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) [L784] 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=1, 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=2] [L784] -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)) [L785] 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=1, 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=2] [L785] -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)) [L786] 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=1, 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=2] [L786] -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)) [L787] 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=1, 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=2] [L787] -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)) [L788] 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=1, 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=2] [L788] -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)) [L789] 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=1, 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=2] [L789] -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)) [L790] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L791] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L791] -1 x = x$flush_delayed ? x$mem_tmp : x [L792] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 180 locations, 3 error locations. UNSAFE Result, 52.2s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 28.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9166 SDtfs, 9557 SDslu, 21777 SDs, 0 SdLazy, 11434 SolverSat, 649 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 92 SyntacticMatches, 21 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43484occurred in iteration=15, 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: 12.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 219956 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2485 NumberOfCodeBlocks, 2485 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2360 ConstructedInterpolants, 0 QuantifiedInterpolants, 464891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...