./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/mix009_rmo.oepc_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 d09e5902c3e47c1de0260aa103bb8e06a6e05e27 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 19:43:07,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 19:43:07,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 19:43:07,022 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 19:43:07,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 19:43:07,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 19:43:07,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 19:43:07,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 19:43:07,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 19:43:07,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 19:43:07,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 19:43:07,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 19:43:07,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 19:43:07,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 19:43:07,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 19:43:07,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 19:43:07,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 19:43:07,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 19:43:07,060 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 19:43:07,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 19:43:07,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 19:43:07,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 19:43:07,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 19:43:07,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 19:43:07,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 19:43:07,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 19:43:07,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 19:43:07,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 19:43:07,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 19:43:07,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 19:43:07,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 19:43:07,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 19:43:07,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 19:43:07,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 19:43:07,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 19:43:07,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 19:43:07,086 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 19:43:07,102 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 19:43:07,102 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 19:43:07,103 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 19:43:07,103 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 19:43:07,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 19:43:07,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 19:43:07,104 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 19:43:07,104 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 19:43:07,104 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 19:43:07,104 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 19:43:07,106 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 19:43:07,106 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 19:43:07,106 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 19:43:07,106 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 19:43:07,106 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 19:43:07,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 19:43:07,107 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 19:43:07,107 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 19:43:07,107 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 19:43:07,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 19:43:07,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 19:43:07,109 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 19:43:07,109 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 19:43:07,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 19:43:07,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 19:43:07,110 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 19:43:07,110 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 19:43:07,110 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 19:43:07,110 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 19:43:07,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 19:43:07,111 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 -> d09e5902c3e47c1de0260aa103bb8e06a6e05e27 [2018-11-28 19:43:07,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 19:43:07,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 19:43:07,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 19:43:07,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 19:43:07,203 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 19:43:07,204 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i [2018-11-28 19:43:07,280 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aeae094e/c2ad52f0ed0f44fca0f5629cdf887da2/FLAG274ff073d [2018-11-28 19:43:07,824 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 19:43:07,825 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i [2018-11-28 19:43:07,846 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aeae094e/c2ad52f0ed0f44fca0f5629cdf887da2/FLAG274ff073d [2018-11-28 19:43:08,100 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aeae094e/c2ad52f0ed0f44fca0f5629cdf887da2 [2018-11-28 19:43:08,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 19:43:08,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 19:43:08,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 19:43:08,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 19:43:08,112 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 19:43:08,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:43:08" (1/1) ... [2018-11-28 19:43:08,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@940847a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:08, skipping insertion in model container [2018-11-28 19:43:08,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:43:08" (1/1) ... [2018-11-28 19:43:08,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 19:43:08,186 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 19:43:08,737 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:43:08,766 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 19:43:08,957 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:43:09,053 INFO L195 MainTranslator]: Completed translation [2018-11-28 19:43:09,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09 WrapperNode [2018-11-28 19:43:09,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 19:43:09,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 19:43:09,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 19:43:09,055 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 19:43:09,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (1/1) ... [2018-11-28 19:43:09,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (1/1) ... [2018-11-28 19:43:09,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 19:43:09,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 19:43:09,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 19:43:09,130 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 19:43:09,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (1/1) ... [2018-11-28 19:43:09,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (1/1) ... [2018-11-28 19:43:09,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (1/1) ... [2018-11-28 19:43:09,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (1/1) ... [2018-11-28 19:43:09,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (1/1) ... [2018-11-28 19:43:09,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (1/1) ... [2018-11-28 19:43:09,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (1/1) ... [2018-11-28 19:43:09,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 19:43:09,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 19:43:09,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 19:43:09,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 19:43:09,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (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-11-28 19:43:09,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 19:43:09,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 19:43:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 19:43:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 19:43:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 19:43:09,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 19:43:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 19:43:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 19:43:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 19:43:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 19:43:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 19:43:09,245 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 19:43:10,394 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 19:43:10,395 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 19:43:10,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:43:10 BoogieIcfgContainer [2018-11-28 19:43:10,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 19:43:10,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 19:43:10,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 19:43:10,401 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 19:43:10,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:43:08" (1/3) ... [2018-11-28 19:43:10,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650c9c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:43:10, skipping insertion in model container [2018-11-28 19:43:10,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:43:09" (2/3) ... [2018-11-28 19:43:10,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650c9c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:43:10, skipping insertion in model container [2018-11-28 19:43:10,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:43:10" (3/3) ... [2018-11-28 19:43:10,406 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_rmo.oepc_false-unreach-call.i [2018-11-28 19:43:10,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,456 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,457 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,457 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,458 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,458 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,459 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,459 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,459 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,460 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,460 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,460 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,460 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,461 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,461 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,461 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,461 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,461 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,462 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,462 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,462 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,462 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,463 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,463 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,463 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,463 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,464 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,464 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,464 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,464 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,466 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,468 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,469 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,480 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,480 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,480 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,480 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:43:10,531 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 19:43:10,531 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 19:43:10,543 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 19:43:10,568 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 19:43:10,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 19:43:10,604 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 19:43:10,604 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 19:43:10,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 19:43:10,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 19:43:10,605 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 19:43:10,605 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 19:43:10,605 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 19:43:10,605 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 19:43:10,630 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2018-11-28 19:43:13,285 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2018-11-28 19:43:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2018-11-28 19:43:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 19:43:13,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:13,298 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] [2018-11-28 19:43:13,302 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:13,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:13,309 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2018-11-28 19:43:13,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:13,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:13,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:13,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:13,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:13,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:13,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:13,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:13,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:13,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:13,651 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2018-11-28 19:43:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:15,036 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2018-11-28 19:43:15,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:15,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-28 19:43:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:15,461 INFO L225 Difference]: With dead ends: 60793 [2018-11-28 19:43:15,461 INFO L226 Difference]: Without dead ends: 44273 [2018-11-28 19:43:15,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2018-11-28 19:43:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2018-11-28 19:43:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2018-11-28 19:43:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2018-11-28 19:43:17,409 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2018-11-28 19:43:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:17,411 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2018-11-28 19:43:17,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2018-11-28 19:43:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 19:43:17,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:17,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:17,426 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:17,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2018-11-28 19:43:17,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:17,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:17,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:17,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:17,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:17,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:17,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:17,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:17,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:17,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:17,560 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 4 states. [2018-11-28 19:43:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:17,869 INFO L93 Difference]: Finished difference Result 8531 states and 28347 transitions. [2018-11-28 19:43:17,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:43:17,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-28 19:43:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:17,904 INFO L225 Difference]: With dead ends: 8531 [2018-11-28 19:43:17,905 INFO L226 Difference]: Without dead ends: 7469 [2018-11-28 19:43:17,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-11-28 19:43:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 7469. [2018-11-28 19:43:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2018-11-28 19:43:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 24639 transitions. [2018-11-28 19:43:18,098 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 24639 transitions. Word has length 48 [2018-11-28 19:43:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:18,099 INFO L480 AbstractCegarLoop]: Abstraction has 7469 states and 24639 transitions. [2018-11-28 19:43:18,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 24639 transitions. [2018-11-28 19:43:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 19:43:18,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:18,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] [2018-11-28 19:43:18,103 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:18,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:18,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2018-11-28 19:43:18,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:18,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:18,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:18,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:18,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:18,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:18,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:18,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:18,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:18,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:18,322 INFO L87 Difference]: Start difference. First operand 7469 states and 24639 transitions. Second operand 5 states. [2018-11-28 19:43:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:19,820 INFO L93 Difference]: Finished difference Result 14001 states and 45808 transitions. [2018-11-28 19:43:19,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:19,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-28 19:43:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:19,898 INFO L225 Difference]: With dead ends: 14001 [2018-11-28 19:43:19,899 INFO L226 Difference]: Without dead ends: 13933 [2018-11-28 19:43:19,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2018-11-28 19:43:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 9444. [2018-11-28 19:43:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9444 states. [2018-11-28 19:43:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 30545 transitions. [2018-11-28 19:43:20,602 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 30545 transitions. Word has length 49 [2018-11-28 19:43:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:20,604 INFO L480 AbstractCegarLoop]: Abstraction has 9444 states and 30545 transitions. [2018-11-28 19:43:20,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 30545 transitions. [2018-11-28 19:43:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 19:43:20,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:20,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:20,608 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:20,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2018-11-28 19:43:20,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:20,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:20,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:20,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:20,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:20,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:20,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:20,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:20,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:20,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:20,707 INFO L87 Difference]: Start difference. First operand 9444 states and 30545 transitions. Second operand 3 states. [2018-11-28 19:43:21,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:21,064 INFO L93 Difference]: Finished difference Result 13282 states and 42644 transitions. [2018-11-28 19:43:21,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:21,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-28 19:43:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:21,099 INFO L225 Difference]: With dead ends: 13282 [2018-11-28 19:43:21,100 INFO L226 Difference]: Without dead ends: 13282 [2018-11-28 19:43:21,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13282 states. [2018-11-28 19:43:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13282 to 9848. [2018-11-28 19:43:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9848 states. [2018-11-28 19:43:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 31511 transitions. [2018-11-28 19:43:21,370 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 31511 transitions. Word has length 51 [2018-11-28 19:43:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:21,371 INFO L480 AbstractCegarLoop]: Abstraction has 9848 states and 31511 transitions. [2018-11-28 19:43:21,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 31511 transitions. [2018-11-28 19:43:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 19:43:21,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:21,376 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] [2018-11-28 19:43:21,376 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:21,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:21,377 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2018-11-28 19:43:21,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:21,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:21,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:21,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:21,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:21,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:21,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:21,682 INFO L87 Difference]: Start difference. First operand 9848 states and 31511 transitions. Second operand 6 states. [2018-11-28 19:43:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:22,438 INFO L93 Difference]: Finished difference Result 14206 states and 45067 transitions. [2018-11-28 19:43:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:22,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-28 19:43:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:22,469 INFO L225 Difference]: With dead ends: 14206 [2018-11-28 19:43:22,469 INFO L226 Difference]: Without dead ends: 14134 [2018-11-28 19:43:22,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:43:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14134 states. [2018-11-28 19:43:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14134 to 10852. [2018-11-28 19:43:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10852 states. [2018-11-28 19:43:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10852 states to 10852 states and 34566 transitions. [2018-11-28 19:43:22,737 INFO L78 Accepts]: Start accepts. Automaton has 10852 states and 34566 transitions. Word has length 55 [2018-11-28 19:43:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:22,737 INFO L480 AbstractCegarLoop]: Abstraction has 10852 states and 34566 transitions. [2018-11-28 19:43:22,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 10852 states and 34566 transitions. [2018-11-28 19:43:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 19:43:22,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:22,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:22,745 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:22,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2018-11-28 19:43:22,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:22,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:22,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:22,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:22,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:22,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:22,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:22,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:22,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:22,892 INFO L87 Difference]: Start difference. First operand 10852 states and 34566 transitions. Second operand 4 states. [2018-11-28 19:43:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:23,146 INFO L93 Difference]: Finished difference Result 12399 states and 39575 transitions. [2018-11-28 19:43:23,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:43:23,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 19:43:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:23,171 INFO L225 Difference]: With dead ends: 12399 [2018-11-28 19:43:23,172 INFO L226 Difference]: Without dead ends: 12399 [2018-11-28 19:43:23,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2018-11-28 19:43:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 11372. [2018-11-28 19:43:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11372 states. [2018-11-28 19:43:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11372 states to 11372 states and 36239 transitions. [2018-11-28 19:43:23,442 INFO L78 Accepts]: Start accepts. Automaton has 11372 states and 36239 transitions. Word has length 63 [2018-11-28 19:43:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:23,442 INFO L480 AbstractCegarLoop]: Abstraction has 11372 states and 36239 transitions. [2018-11-28 19:43:23,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 11372 states and 36239 transitions. [2018-11-28 19:43:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 19:43:23,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:23,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:23,451 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:23,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2018-11-28 19:43:23,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:23,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:23,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:23,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:23,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:23,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:23,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:23,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:23,849 INFO L87 Difference]: Start difference. First operand 11372 states and 36239 transitions. Second operand 6 states. [2018-11-28 19:43:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:25,959 INFO L93 Difference]: Finished difference Result 20972 states and 66489 transitions. [2018-11-28 19:43:25,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:25,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-28 19:43:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:26,002 INFO L225 Difference]: With dead ends: 20972 [2018-11-28 19:43:26,002 INFO L226 Difference]: Without dead ends: 20901 [2018-11-28 19:43:26,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:43:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2018-11-28 19:43:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 13758. [2018-11-28 19:43:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13758 states. [2018-11-28 19:43:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13758 states to 13758 states and 43283 transitions. [2018-11-28 19:43:26,868 INFO L78 Accepts]: Start accepts. Automaton has 13758 states and 43283 transitions. Word has length 63 [2018-11-28 19:43:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:26,868 INFO L480 AbstractCegarLoop]: Abstraction has 13758 states and 43283 transitions. [2018-11-28 19:43:26,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 13758 states and 43283 transitions. [2018-11-28 19:43:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 19:43:26,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:26,879 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] [2018-11-28 19:43:26,880 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:26,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash 81708496, now seen corresponding path program 1 times [2018-11-28 19:43:26,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:26,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:26,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:26,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:26,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:27,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:27,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:27,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:27,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:27,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:27,096 INFO L87 Difference]: Start difference. First operand 13758 states and 43283 transitions. Second operand 4 states. [2018-11-28 19:43:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:28,002 INFO L93 Difference]: Finished difference Result 19950 states and 63167 transitions. [2018-11-28 19:43:28,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:28,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 19:43:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:28,050 INFO L225 Difference]: With dead ends: 19950 [2018-11-28 19:43:28,050 INFO L226 Difference]: Without dead ends: 19950 [2018-11-28 19:43:28,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19950 states. [2018-11-28 19:43:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19950 to 17922. [2018-11-28 19:43:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17922 states. [2018-11-28 19:43:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17922 states to 17922 states and 57082 transitions. [2018-11-28 19:43:28,377 INFO L78 Accepts]: Start accepts. Automaton has 17922 states and 57082 transitions. Word has length 67 [2018-11-28 19:43:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:28,377 INFO L480 AbstractCegarLoop]: Abstraction has 17922 states and 57082 transitions. [2018-11-28 19:43:28,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 17922 states and 57082 transitions. [2018-11-28 19:43:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 19:43:28,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:28,388 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] [2018-11-28 19:43:28,389 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:28,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:28,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1725745967, now seen corresponding path program 1 times [2018-11-28 19:43:28,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:28,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:28,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:28,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:28,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:28,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:28,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:28,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:28,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:28,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:28,603 INFO L87 Difference]: Start difference. First operand 17922 states and 57082 transitions. Second operand 4 states. [2018-11-28 19:43:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:29,110 INFO L93 Difference]: Finished difference Result 22122 states and 69359 transitions. [2018-11-28 19:43:29,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:29,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 19:43:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:29,149 INFO L225 Difference]: With dead ends: 22122 [2018-11-28 19:43:29,149 INFO L226 Difference]: Without dead ends: 22122 [2018-11-28 19:43:29,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22122 states. [2018-11-28 19:43:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22122 to 20008. [2018-11-28 19:43:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2018-11-28 19:43:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 63081 transitions. [2018-11-28 19:43:29,478 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 63081 transitions. Word has length 67 [2018-11-28 19:43:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:29,478 INFO L480 AbstractCegarLoop]: Abstraction has 20008 states and 63081 transitions. [2018-11-28 19:43:29,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 63081 transitions. [2018-11-28 19:43:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 19:43:29,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:29,492 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] [2018-11-28 19:43:29,492 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:29,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:29,492 INFO L82 PathProgramCache]: Analyzing trace with hash 492011986, now seen corresponding path program 1 times [2018-11-28 19:43:29,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:29,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:29,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:29,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:29,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:29,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:29,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:29,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:29,615 INFO L87 Difference]: Start difference. First operand 20008 states and 63081 transitions. Second operand 3 states. [2018-11-28 19:43:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:30,649 INFO L93 Difference]: Finished difference Result 20728 states and 65064 transitions. [2018-11-28 19:43:30,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:30,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-11-28 19:43:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:30,687 INFO L225 Difference]: With dead ends: 20728 [2018-11-28 19:43:30,687 INFO L226 Difference]: Without dead ends: 20728 [2018-11-28 19:43:30,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20728 states. [2018-11-28 19:43:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20728 to 20404. [2018-11-28 19:43:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20404 states. [2018-11-28 19:43:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20404 states to 20404 states and 64159 transitions. [2018-11-28 19:43:31,001 INFO L78 Accepts]: Start accepts. Automaton has 20404 states and 64159 transitions. Word has length 67 [2018-11-28 19:43:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:31,002 INFO L480 AbstractCegarLoop]: Abstraction has 20404 states and 64159 transitions. [2018-11-28 19:43:31,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 20404 states and 64159 transitions. [2018-11-28 19:43:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:31,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:31,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:31,014 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:31,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2096525335, now seen corresponding path program 1 times [2018-11-28 19:43:31,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:31,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:31,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:31,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:31,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:31,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:31,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:31,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:31,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:31,143 INFO L87 Difference]: Start difference. First operand 20404 states and 64159 transitions. Second operand 3 states. [2018-11-28 19:43:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:31,402 INFO L93 Difference]: Finished difference Result 25692 states and 80601 transitions. [2018-11-28 19:43:31,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:31,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 19:43:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:31,449 INFO L225 Difference]: With dead ends: 25692 [2018-11-28 19:43:31,449 INFO L226 Difference]: Without dead ends: 25692 [2018-11-28 19:43:31,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25692 states. [2018-11-28 19:43:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25692 to 24788. [2018-11-28 19:43:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24788 states. [2018-11-28 19:43:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24788 states to 24788 states and 77827 transitions. [2018-11-28 19:43:31,817 INFO L78 Accepts]: Start accepts. Automaton has 24788 states and 77827 transitions. Word has length 69 [2018-11-28 19:43:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:31,817 INFO L480 AbstractCegarLoop]: Abstraction has 24788 states and 77827 transitions. [2018-11-28 19:43:31,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24788 states and 77827 transitions. [2018-11-28 19:43:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:31,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:31,830 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] [2018-11-28 19:43:31,831 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:31,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -401490602, now seen corresponding path program 1 times [2018-11-28 19:43:31,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:31,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:31,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:31,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:31,997 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 19:43:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:32,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:32,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:32,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:32,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:32,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:32,045 INFO L87 Difference]: Start difference. First operand 24788 states and 77827 transitions. Second operand 6 states. [2018-11-28 19:43:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:33,463 INFO L93 Difference]: Finished difference Result 29944 states and 92734 transitions. [2018-11-28 19:43:33,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:33,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-28 19:43:33,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:33,527 INFO L225 Difference]: With dead ends: 29944 [2018-11-28 19:43:33,527 INFO L226 Difference]: Without dead ends: 29944 [2018-11-28 19:43:33,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29944 states. [2018-11-28 19:43:33,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29944 to 28268. [2018-11-28 19:43:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28268 states. [2018-11-28 19:43:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28268 states to 28268 states and 88152 transitions. [2018-11-28 19:43:33,990 INFO L78 Accepts]: Start accepts. Automaton has 28268 states and 88152 transitions. Word has length 69 [2018-11-28 19:43:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:33,991 INFO L480 AbstractCegarLoop]: Abstraction has 28268 states and 88152 transitions. [2018-11-28 19:43:33,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 28268 states and 88152 transitions. [2018-11-28 19:43:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:34,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:34,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] [2018-11-28 19:43:34,005 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:34,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:34,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1816267351, now seen corresponding path program 1 times [2018-11-28 19:43:34,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:34,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:34,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:34,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:34,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:34,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:34,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:34,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:34,246 INFO L87 Difference]: Start difference. First operand 28268 states and 88152 transitions. Second operand 6 states. [2018-11-28 19:43:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:35,147 INFO L93 Difference]: Finished difference Result 32012 states and 96857 transitions. [2018-11-28 19:43:35,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:43:35,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-28 19:43:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:35,211 INFO L225 Difference]: With dead ends: 32012 [2018-11-28 19:43:35,211 INFO L226 Difference]: Without dead ends: 32012 [2018-11-28 19:43:35,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32012 states. [2018-11-28 19:43:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32012 to 28944. [2018-11-28 19:43:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28944 states. [2018-11-28 19:43:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28944 states to 28944 states and 88943 transitions. [2018-11-28 19:43:36,199 INFO L78 Accepts]: Start accepts. Automaton has 28944 states and 88943 transitions. Word has length 69 [2018-11-28 19:43:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:36,199 INFO L480 AbstractCegarLoop]: Abstraction has 28944 states and 88943 transitions. [2018-11-28 19:43:36,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 28944 states and 88943 transitions. [2018-11-28 19:43:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:36,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:36,215 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] [2018-11-28 19:43:36,216 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:36,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2027618264, now seen corresponding path program 1 times [2018-11-28 19:43:36,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:36,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:36,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:36,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:36,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:36,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:36,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:36,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:36,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:36,649 INFO L87 Difference]: Start difference. First operand 28944 states and 88943 transitions. Second operand 5 states. [2018-11-28 19:43:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:37,508 INFO L93 Difference]: Finished difference Result 35071 states and 107222 transitions. [2018-11-28 19:43:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:37,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 19:43:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:37,571 INFO L225 Difference]: With dead ends: 35071 [2018-11-28 19:43:37,571 INFO L226 Difference]: Without dead ends: 35071 [2018-11-28 19:43:37,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35071 states. [2018-11-28 19:43:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35071 to 31628. [2018-11-28 19:43:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31628 states. [2018-11-28 19:43:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31628 states to 31628 states and 96602 transitions. [2018-11-28 19:43:38,079 INFO L78 Accepts]: Start accepts. Automaton has 31628 states and 96602 transitions. Word has length 69 [2018-11-28 19:43:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:38,079 INFO L480 AbstractCegarLoop]: Abstraction has 31628 states and 96602 transitions. [2018-11-28 19:43:38,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 31628 states and 96602 transitions. [2018-11-28 19:43:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:38,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:38,094 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] [2018-11-28 19:43:38,095 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:38,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:38,095 INFO L82 PathProgramCache]: Analyzing trace with hash -279867272, now seen corresponding path program 1 times [2018-11-28 19:43:38,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:38,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:38,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:38,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:38,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:38,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:38,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:38,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:38,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:38,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:38,214 INFO L87 Difference]: Start difference. First operand 31628 states and 96602 transitions. Second operand 3 states. [2018-11-28 19:43:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:38,620 INFO L93 Difference]: Finished difference Result 42528 states and 128529 transitions. [2018-11-28 19:43:38,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:38,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 19:43:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:38,701 INFO L225 Difference]: With dead ends: 42528 [2018-11-28 19:43:38,701 INFO L226 Difference]: Without dead ends: 42528 [2018-11-28 19:43:38,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42528 states. [2018-11-28 19:43:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42528 to 32736. [2018-11-28 19:43:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32736 states. [2018-11-28 19:43:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32736 states to 32736 states and 99897 transitions. [2018-11-28 19:43:39,367 INFO L78 Accepts]: Start accepts. Automaton has 32736 states and 99897 transitions. Word has length 69 [2018-11-28 19:43:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:39,368 INFO L480 AbstractCegarLoop]: Abstraction has 32736 states and 99897 transitions. [2018-11-28 19:43:39,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32736 states and 99897 transitions. [2018-11-28 19:43:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:39,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:39,383 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] [2018-11-28 19:43:39,383 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:39,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2087321735, now seen corresponding path program 1 times [2018-11-28 19:43:39,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:39,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:39,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:39,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:39,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:39,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:39,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:39,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:39,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:39,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:39,555 INFO L87 Difference]: Start difference. First operand 32736 states and 99897 transitions. Second operand 5 states. [2018-11-28 19:43:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:39,624 INFO L93 Difference]: Finished difference Result 7904 states and 19093 transitions. [2018-11-28 19:43:39,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:43:39,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 19:43:39,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:39,632 INFO L225 Difference]: With dead ends: 7904 [2018-11-28 19:43:39,633 INFO L226 Difference]: Without dead ends: 6422 [2018-11-28 19:43:39,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6422 states. [2018-11-28 19:43:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6422 to 5770. [2018-11-28 19:43:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5770 states. [2018-11-28 19:43:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 13511 transitions. [2018-11-28 19:43:39,700 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 13511 transitions. Word has length 69 [2018-11-28 19:43:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:39,701 INFO L480 AbstractCegarLoop]: Abstraction has 5770 states and 13511 transitions. [2018-11-28 19:43:39,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 13511 transitions. [2018-11-28 19:43:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 19:43:39,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:39,706 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] [2018-11-28 19:43:39,707 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:39,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2018-11-28 19:43:39,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:39,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:39,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:39,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:39,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:39,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:39,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:43:39,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:43:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:43:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:39,783 INFO L87 Difference]: Start difference. First operand 5770 states and 13511 transitions. Second operand 3 states. [2018-11-28 19:43:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:39,978 INFO L93 Difference]: Finished difference Result 7636 states and 17741 transitions. [2018-11-28 19:43:39,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:43:39,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 19:43:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:39,985 INFO L225 Difference]: With dead ends: 7636 [2018-11-28 19:43:39,985 INFO L226 Difference]: Without dead ends: 7636 [2018-11-28 19:43:39,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:43:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7636 states. [2018-11-28 19:43:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7636 to 5709. [2018-11-28 19:43:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2018-11-28 19:43:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 13051 transitions. [2018-11-28 19:43:40,059 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 13051 transitions. Word has length 69 [2018-11-28 19:43:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:40,060 INFO L480 AbstractCegarLoop]: Abstraction has 5709 states and 13051 transitions. [2018-11-28 19:43:40,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:43:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 13051 transitions. [2018-11-28 19:43:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 19:43:40,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:40,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:40,067 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:40,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2018-11-28 19:43:40,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:40,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:40,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:40,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:40,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:40,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:40,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:40,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:40,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:40,283 INFO L87 Difference]: Start difference. First operand 5709 states and 13051 transitions. Second operand 5 states. [2018-11-28 19:43:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:40,539 INFO L93 Difference]: Finished difference Result 6873 states and 15675 transitions. [2018-11-28 19:43:40,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:43:40,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-28 19:43:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:40,550 INFO L225 Difference]: With dead ends: 6873 [2018-11-28 19:43:40,550 INFO L226 Difference]: Without dead ends: 6873 [2018-11-28 19:43:40,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6873 states. [2018-11-28 19:43:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6873 to 6153. [2018-11-28 19:43:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2018-11-28 19:43:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 14055 transitions. [2018-11-28 19:43:40,616 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 14055 transitions. Word has length 75 [2018-11-28 19:43:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:40,616 INFO L480 AbstractCegarLoop]: Abstraction has 6153 states and 14055 transitions. [2018-11-28 19:43:40,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 14055 transitions. [2018-11-28 19:43:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 19:43:40,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:40,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:40,623 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:40,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:40,623 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2018-11-28 19:43:40,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:40,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:40,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:40,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:40,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:40,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:40,836 INFO L87 Difference]: Start difference. First operand 6153 states and 14055 transitions. Second operand 7 states. [2018-11-28 19:43:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:41,393 INFO L93 Difference]: Finished difference Result 7531 states and 17026 transitions. [2018-11-28 19:43:41,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 19:43:41,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-28 19:43:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:41,405 INFO L225 Difference]: With dead ends: 7531 [2018-11-28 19:43:41,405 INFO L226 Difference]: Without dead ends: 7412 [2018-11-28 19:43:41,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-28 19:43:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7412 states. [2018-11-28 19:43:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7412 to 6250. [2018-11-28 19:43:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6250 states. [2018-11-28 19:43:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6250 states to 6250 states and 14148 transitions. [2018-11-28 19:43:41,482 INFO L78 Accepts]: Start accepts. Automaton has 6250 states and 14148 transitions. Word has length 75 [2018-11-28 19:43:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:41,483 INFO L480 AbstractCegarLoop]: Abstraction has 6250 states and 14148 transitions. [2018-11-28 19:43:41,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 6250 states and 14148 transitions. [2018-11-28 19:43:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 19:43:41,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:41,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:41,491 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:41,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:41,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1874738626, now seen corresponding path program 1 times [2018-11-28 19:43:41,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:41,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:41,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:41,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:41,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:41,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:41,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:41,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:41,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:41,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:41,604 INFO L87 Difference]: Start difference. First operand 6250 states and 14148 transitions. Second operand 4 states. [2018-11-28 19:43:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:41,959 INFO L93 Difference]: Finished difference Result 9985 states and 22523 transitions. [2018-11-28 19:43:41,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:41,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-28 19:43:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:41,972 INFO L225 Difference]: With dead ends: 9985 [2018-11-28 19:43:41,972 INFO L226 Difference]: Without dead ends: 9985 [2018-11-28 19:43:41,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9985 states. [2018-11-28 19:43:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9985 to 7370. [2018-11-28 19:43:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7370 states. [2018-11-28 19:43:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7370 states to 7370 states and 16482 transitions. [2018-11-28 19:43:42,060 INFO L78 Accepts]: Start accepts. Automaton has 7370 states and 16482 transitions. Word has length 94 [2018-11-28 19:43:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:42,060 INFO L480 AbstractCegarLoop]: Abstraction has 7370 states and 16482 transitions. [2018-11-28 19:43:42,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 7370 states and 16482 transitions. [2018-11-28 19:43:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 19:43:42,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:42,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:42,069 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:42,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash 98576610, now seen corresponding path program 2 times [2018-11-28 19:43:42,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:42,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:42,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:42,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:42,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:42,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:42,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:42,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:42,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:42,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:42,173 INFO L87 Difference]: Start difference. First operand 7370 states and 16482 transitions. Second operand 4 states. [2018-11-28 19:43:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:42,407 INFO L93 Difference]: Finished difference Result 10358 states and 22888 transitions. [2018-11-28 19:43:42,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:42,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-28 19:43:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:42,421 INFO L225 Difference]: With dead ends: 10358 [2018-11-28 19:43:42,421 INFO L226 Difference]: Without dead ends: 10358 [2018-11-28 19:43:42,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10358 states. [2018-11-28 19:43:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10358 to 8483. [2018-11-28 19:43:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8483 states. [2018-11-28 19:43:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 18999 transitions. [2018-11-28 19:43:42,530 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 18999 transitions. Word has length 94 [2018-11-28 19:43:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:42,530 INFO L480 AbstractCegarLoop]: Abstraction has 8483 states and 18999 transitions. [2018-11-28 19:43:42,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 18999 transitions. [2018-11-28 19:43:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 19:43:42,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:42,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:42,542 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:42,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:42,542 INFO L82 PathProgramCache]: Analyzing trace with hash 500673531, now seen corresponding path program 1 times [2018-11-28 19:43:42,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:42,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:42,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:42,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:42,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:42,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:42,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:43:42,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:43:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:43:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:43:42,740 INFO L87 Difference]: Start difference. First operand 8483 states and 18999 transitions. Second operand 4 states. [2018-11-28 19:43:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:42,861 INFO L93 Difference]: Finished difference Result 8172 states and 18361 transitions. [2018-11-28 19:43:42,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:43:42,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-28 19:43:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:42,871 INFO L225 Difference]: With dead ends: 8172 [2018-11-28 19:43:42,871 INFO L226 Difference]: Without dead ends: 8172 [2018-11-28 19:43:42,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states. [2018-11-28 19:43:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 7576. [2018-11-28 19:43:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7576 states. [2018-11-28 19:43:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7576 states to 7576 states and 17098 transitions. [2018-11-28 19:43:42,959 INFO L78 Accepts]: Start accepts. Automaton has 7576 states and 17098 transitions. Word has length 94 [2018-11-28 19:43:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:42,959 INFO L480 AbstractCegarLoop]: Abstraction has 7576 states and 17098 transitions. [2018-11-28 19:43:42,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:43:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 7576 states and 17098 transitions. [2018-11-28 19:43:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:42,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:42,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:42,969 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:42,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1777281593, now seen corresponding path program 1 times [2018-11-28 19:43:42,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:42,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:42,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:42,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:42,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:43,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:43,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:43,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:43,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:43,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:43,110 INFO L87 Difference]: Start difference. First operand 7576 states and 17098 transitions. Second operand 7 states. [2018-11-28 19:43:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:43,831 INFO L93 Difference]: Finished difference Result 9459 states and 21323 transitions. [2018-11-28 19:43:43,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:43,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 19:43:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:43,845 INFO L225 Difference]: With dead ends: 9459 [2018-11-28 19:43:43,845 INFO L226 Difference]: Without dead ends: 9459 [2018-11-28 19:43:43,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9459 states. [2018-11-28 19:43:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9459 to 7665. [2018-11-28 19:43:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7665 states. [2018-11-28 19:43:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7665 states to 7665 states and 17369 transitions. [2018-11-28 19:43:43,947 INFO L78 Accepts]: Start accepts. Automaton has 7665 states and 17369 transitions. Word has length 96 [2018-11-28 19:43:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:43,947 INFO L480 AbstractCegarLoop]: Abstraction has 7665 states and 17369 transitions. [2018-11-28 19:43:43,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 7665 states and 17369 transitions. [2018-11-28 19:43:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:43,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:43,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:43,957 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:43,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1611485258, now seen corresponding path program 1 times [2018-11-28 19:43:43,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:43,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:43,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:43,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:44,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:44,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:44,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:44,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:44,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:44,125 INFO L87 Difference]: Start difference. First operand 7665 states and 17369 transitions. Second operand 5 states. [2018-11-28 19:43:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:44,255 INFO L93 Difference]: Finished difference Result 8528 states and 19228 transitions. [2018-11-28 19:43:44,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:44,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-28 19:43:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:44,266 INFO L225 Difference]: With dead ends: 8528 [2018-11-28 19:43:44,267 INFO L226 Difference]: Without dead ends: 8528 [2018-11-28 19:43:44,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8528 states. [2018-11-28 19:43:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8528 to 6561. [2018-11-28 19:43:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6561 states. [2018-11-28 19:43:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 14888 transitions. [2018-11-28 19:43:44,350 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 14888 transitions. Word has length 96 [2018-11-28 19:43:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:44,350 INFO L480 AbstractCegarLoop]: Abstraction has 6561 states and 14888 transitions. [2018-11-28 19:43:44,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 14888 transitions. [2018-11-28 19:43:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:44,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:44,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:44,359 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:44,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:44,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1356748713, now seen corresponding path program 1 times [2018-11-28 19:43:44,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:44,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:44,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:44,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-11-28 19:43:44,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:44,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:43:44,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:43:44,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:43:44,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:43:44,562 INFO L87 Difference]: Start difference. First operand 6561 states and 14888 transitions. Second operand 5 states. [2018-11-28 19:43:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:45,077 INFO L93 Difference]: Finished difference Result 10030 states and 22788 transitions. [2018-11-28 19:43:45,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:43:45,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-28 19:43:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:45,090 INFO L225 Difference]: With dead ends: 10030 [2018-11-28 19:43:45,091 INFO L226 Difference]: Without dead ends: 9952 [2018-11-28 19:43:45,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9952 states. [2018-11-28 19:43:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9952 to 7455. [2018-11-28 19:43:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7455 states. [2018-11-28 19:43:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 16912 transitions. [2018-11-28 19:43:45,189 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 16912 transitions. Word has length 96 [2018-11-28 19:43:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:45,189 INFO L480 AbstractCegarLoop]: Abstraction has 7455 states and 16912 transitions. [2018-11-28 19:43:45,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:43:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 16912 transitions. [2018-11-28 19:43:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:45,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:45,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:45,200 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:45,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:45,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1693454102, now seen corresponding path program 1 times [2018-11-28 19:43:45,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:45,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:45,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:45,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:45,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:45,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:45,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:45,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:45,464 INFO L87 Difference]: Start difference. First operand 7455 states and 16912 transitions. Second operand 6 states. [2018-11-28 19:43:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:45,884 INFO L93 Difference]: Finished difference Result 9421 states and 21193 transitions. [2018-11-28 19:43:45,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 19:43:45,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-28 19:43:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:45,896 INFO L225 Difference]: With dead ends: 9421 [2018-11-28 19:43:45,896 INFO L226 Difference]: Without dead ends: 9333 [2018-11-28 19:43:45,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:43:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9333 states. [2018-11-28 19:43:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9333 to 7000. [2018-11-28 19:43:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7000 states. [2018-11-28 19:43:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7000 states to 7000 states and 15908 transitions. [2018-11-28 19:43:45,992 INFO L78 Accepts]: Start accepts. Automaton has 7000 states and 15908 transitions. Word has length 96 [2018-11-28 19:43:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:45,992 INFO L480 AbstractCegarLoop]: Abstraction has 7000 states and 15908 transitions. [2018-11-28 19:43:45,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 7000 states and 15908 transitions. [2018-11-28 19:43:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:46,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:46,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:46,001 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:46,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:46,001 INFO L82 PathProgramCache]: Analyzing trace with hash -564113265, now seen corresponding path program 1 times [2018-11-28 19:43:46,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:46,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:46,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:46,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:46,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:46,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:46,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 19:43:46,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 19:43:46,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 19:43:46,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:46,217 INFO L87 Difference]: Start difference. First operand 7000 states and 15908 transitions. Second operand 8 states. [2018-11-28 19:43:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:47,840 INFO L93 Difference]: Finished difference Result 10183 states and 23377 transitions. [2018-11-28 19:43:47,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:47,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-11-28 19:43:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:47,854 INFO L225 Difference]: With dead ends: 10183 [2018-11-28 19:43:47,855 INFO L226 Difference]: Without dead ends: 10183 [2018-11-28 19:43:47,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-28 19:43:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10183 states. [2018-11-28 19:43:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10183 to 7405. [2018-11-28 19:43:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7405 states. [2018-11-28 19:43:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7405 states to 7405 states and 16958 transitions. [2018-11-28 19:43:47,994 INFO L78 Accepts]: Start accepts. Automaton has 7405 states and 16958 transitions. Word has length 96 [2018-11-28 19:43:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:47,995 INFO L480 AbstractCegarLoop]: Abstraction has 7405 states and 16958 transitions. [2018-11-28 19:43:47,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 19:43:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7405 states and 16958 transitions. [2018-11-28 19:43:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:48,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:48,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, 1, 1, 1] [2018-11-28 19:43:48,005 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:48,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:48,006 INFO L82 PathProgramCache]: Analyzing trace with hash 323390416, now seen corresponding path program 1 times [2018-11-28 19:43:48,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:48,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:48,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:48,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:48,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:48,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:48,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 19:43:48,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 19:43:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 19:43:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-28 19:43:48,252 INFO L87 Difference]: Start difference. First operand 7405 states and 16958 transitions. Second operand 10 states. [2018-11-28 19:43:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:49,319 INFO L93 Difference]: Finished difference Result 11432 states and 26103 transitions. [2018-11-28 19:43:49,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 19:43:49,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-11-28 19:43:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:49,334 INFO L225 Difference]: With dead ends: 11432 [2018-11-28 19:43:49,334 INFO L226 Difference]: Without dead ends: 11432 [2018-11-28 19:43:49,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-11-28 19:43:49,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11432 states. [2018-11-28 19:43:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11432 to 9031. [2018-11-28 19:43:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9031 states. [2018-11-28 19:43:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 20483 transitions. [2018-11-28 19:43:49,446 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 20483 transitions. Word has length 96 [2018-11-28 19:43:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:49,447 INFO L480 AbstractCegarLoop]: Abstraction has 9031 states and 20483 transitions. [2018-11-28 19:43:49,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 19:43:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 20483 transitions. [2018-11-28 19:43:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 19:43:49,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:49,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:49,457 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:49,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:49,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1408585136, now seen corresponding path program 1 times [2018-11-28 19:43:49,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:49,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:49,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:49,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:49,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:49,887 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 19:43:50,296 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-11-28 19:43:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:50,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:50,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:50,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:50,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:50,318 INFO L87 Difference]: Start difference. First operand 9031 states and 20483 transitions. Second operand 6 states. [2018-11-28 19:43:50,664 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 19:43:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:51,040 INFO L93 Difference]: Finished difference Result 8775 states and 19683 transitions. [2018-11-28 19:43:51,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:51,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-28 19:43:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:51,053 INFO L225 Difference]: With dead ends: 8775 [2018-11-28 19:43:51,053 INFO L226 Difference]: Without dead ends: 8775 [2018-11-28 19:43:51,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8775 states. [2018-11-28 19:43:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8775 to 7134. [2018-11-28 19:43:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2018-11-28 19:43:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 16071 transitions. [2018-11-28 19:43:51,216 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 16071 transitions. Word has length 96 [2018-11-28 19:43:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:51,216 INFO L480 AbstractCegarLoop]: Abstraction has 7134 states and 16071 transitions. [2018-11-28 19:43:51,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 16071 transitions. [2018-11-28 19:43:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:51,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:51,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:51,226 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:51,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash -287165680, now seen corresponding path program 1 times [2018-11-28 19:43:51,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:51,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:51,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:51,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:51,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:43:51,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:43:51,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:43:51,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:51,425 INFO L87 Difference]: Start difference. First operand 7134 states and 16071 transitions. Second operand 9 states. [2018-11-28 19:43:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:51,974 INFO L93 Difference]: Finished difference Result 8476 states and 18918 transitions. [2018-11-28 19:43:51,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 19:43:51,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-11-28 19:43:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:51,987 INFO L225 Difference]: With dead ends: 8476 [2018-11-28 19:43:51,987 INFO L226 Difference]: Without dead ends: 8476 [2018-11-28 19:43:51,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-11-28 19:43:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8476 states. [2018-11-28 19:43:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8476 to 8212. [2018-11-28 19:43:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8212 states. [2018-11-28 19:43:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8212 states to 8212 states and 18398 transitions. [2018-11-28 19:43:52,077 INFO L78 Accepts]: Start accepts. Automaton has 8212 states and 18398 transitions. Word has length 98 [2018-11-28 19:43:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:52,078 INFO L480 AbstractCegarLoop]: Abstraction has 8212 states and 18398 transitions. [2018-11-28 19:43:52,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:43:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 8212 states and 18398 transitions. [2018-11-28 19:43:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:52,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:52,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:52,087 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:52,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 600338001, now seen corresponding path program 1 times [2018-11-28 19:43:52,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:52,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:52,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:52,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:43:52,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:43:52,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:43:52,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:52,332 INFO L87 Difference]: Start difference. First operand 8212 states and 18398 transitions. Second operand 9 states. [2018-11-28 19:43:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:53,163 INFO L93 Difference]: Finished difference Result 12530 states and 28025 transitions. [2018-11-28 19:43:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:43:53,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-11-28 19:43:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:53,175 INFO L225 Difference]: With dead ends: 12530 [2018-11-28 19:43:53,175 INFO L226 Difference]: Without dead ends: 9319 [2018-11-28 19:43:53,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-28 19:43:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9319 states. [2018-11-28 19:43:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9319 to 8269. [2018-11-28 19:43:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8269 states. [2018-11-28 19:43:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 18515 transitions. [2018-11-28 19:43:53,267 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 18515 transitions. Word has length 98 [2018-11-28 19:43:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:53,267 INFO L480 AbstractCegarLoop]: Abstraction has 8269 states and 18515 transitions. [2018-11-28 19:43:53,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:43:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 18515 transitions. [2018-11-28 19:43:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:53,281 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:53,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:53,281 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:53,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:53,281 INFO L82 PathProgramCache]: Analyzing trace with hash -543309766, now seen corresponding path program 1 times [2018-11-28 19:43:53,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:53,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:53,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:54,011 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 19:43:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:54,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:54,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:54,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:54,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:54,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:54,029 INFO L87 Difference]: Start difference. First operand 8269 states and 18515 transitions. Second operand 6 states. [2018-11-28 19:43:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:54,256 INFO L93 Difference]: Finished difference Result 9209 states and 20352 transitions. [2018-11-28 19:43:54,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:43:54,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-11-28 19:43:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:54,268 INFO L225 Difference]: With dead ends: 9209 [2018-11-28 19:43:54,268 INFO L226 Difference]: Without dead ends: 9152 [2018-11-28 19:43:54,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9152 states. [2018-11-28 19:43:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9152 to 8173. [2018-11-28 19:43:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8173 states. [2018-11-28 19:43:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8173 states to 8173 states and 18170 transitions. [2018-11-28 19:43:54,357 INFO L78 Accepts]: Start accepts. Automaton has 8173 states and 18170 transitions. Word has length 98 [2018-11-28 19:43:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:54,357 INFO L480 AbstractCegarLoop]: Abstraction has 8173 states and 18170 transitions. [2018-11-28 19:43:54,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 8173 states and 18170 transitions. [2018-11-28 19:43:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:54,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:54,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:54,369 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:54,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:54,369 INFO L82 PathProgramCache]: Analyzing trace with hash -622904778, now seen corresponding path program 2 times [2018-11-28 19:43:54,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:54,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:54,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:54,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:54,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:54,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:54,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:43:54,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:43:54,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:43:54,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:43:54,875 INFO L87 Difference]: Start difference. First operand 8173 states and 18170 transitions. Second operand 6 states. [2018-11-28 19:43:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:55,102 INFO L93 Difference]: Finished difference Result 8417 states and 18664 transitions. [2018-11-28 19:43:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:43:55,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-11-28 19:43:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:55,113 INFO L225 Difference]: With dead ends: 8417 [2018-11-28 19:43:55,113 INFO L226 Difference]: Without dead ends: 8417 [2018-11-28 19:43:55,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:43:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8417 states. [2018-11-28 19:43:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8417 to 8092. [2018-11-28 19:43:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8092 states. [2018-11-28 19:43:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8092 states to 8092 states and 17987 transitions. [2018-11-28 19:43:55,207 INFO L78 Accepts]: Start accepts. Automaton has 8092 states and 17987 transitions. Word has length 98 [2018-11-28 19:43:55,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:55,207 INFO L480 AbstractCegarLoop]: Abstraction has 8092 states and 17987 transitions. [2018-11-28 19:43:55,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:43:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 8092 states and 17987 transitions. [2018-11-28 19:43:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:55,217 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:55,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:55,217 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:55,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash -419236519, now seen corresponding path program 2 times [2018-11-28 19:43:55,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:55,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:55,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:55,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:55,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:55,550 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 19:43:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:55,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:55,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:43:55,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:43:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:43:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:43:55,966 INFO L87 Difference]: Start difference. First operand 8092 states and 17987 transitions. Second operand 9 states. [2018-11-28 19:43:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:56,192 INFO L93 Difference]: Finished difference Result 12168 states and 27134 transitions. [2018-11-28 19:43:56,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:43:56,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-11-28 19:43:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:56,200 INFO L225 Difference]: With dead ends: 12168 [2018-11-28 19:43:56,200 INFO L226 Difference]: Without dead ends: 4321 [2018-11-28 19:43:56,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-28 19:43:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2018-11-28 19:43:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 4321. [2018-11-28 19:43:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2018-11-28 19:43:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 9622 transitions. [2018-11-28 19:43:56,246 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 9622 transitions. Word has length 98 [2018-11-28 19:43:56,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:56,246 INFO L480 AbstractCegarLoop]: Abstraction has 4321 states and 9622 transitions. [2018-11-28 19:43:56,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:43:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 9622 transitions. [2018-11-28 19:43:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:56,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:56,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:56,251 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:56,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2050487941, now seen corresponding path program 3 times [2018-11-28 19:43:56,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:56,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:56,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:56,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:56,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:56,546 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 19:43:56,719 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 19:43:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:56,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:56,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 19:43:56,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 19:43:56,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 19:43:56,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 19:43:56,934 INFO L87 Difference]: Start difference. First operand 4321 states and 9622 transitions. Second operand 11 states. [2018-11-28 19:43:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:58,167 INFO L93 Difference]: Finished difference Result 8451 states and 18965 transitions. [2018-11-28 19:43:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 19:43:58,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-11-28 19:43:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:58,176 INFO L225 Difference]: With dead ends: 8451 [2018-11-28 19:43:58,176 INFO L226 Difference]: Without dead ends: 5653 [2018-11-28 19:43:58,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-11-28 19:43:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5653 states. [2018-11-28 19:43:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5653 to 4354. [2018-11-28 19:43:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4354 states. [2018-11-28 19:43:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4354 states to 4354 states and 9648 transitions. [2018-11-28 19:43:58,226 INFO L78 Accepts]: Start accepts. Automaton has 4354 states and 9648 transitions. Word has length 98 [2018-11-28 19:43:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:58,226 INFO L480 AbstractCegarLoop]: Abstraction has 4354 states and 9648 transitions. [2018-11-28 19:43:58,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 19:43:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4354 states and 9648 transitions. [2018-11-28 19:43:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:58,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:58,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:58,232 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:58,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:58,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1559092180, now seen corresponding path program 1 times [2018-11-28 19:43:58,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:58,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:58,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:58,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:43:58,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:43:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:43:58,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:43:58,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:43:58,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:43:58,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:43:58,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:43:58,376 INFO L87 Difference]: Start difference. First operand 4354 states and 9648 transitions. Second operand 7 states. [2018-11-28 19:43:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:43:58,718 INFO L93 Difference]: Finished difference Result 4594 states and 10120 transitions. [2018-11-28 19:43:58,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 19:43:58,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-11-28 19:43:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:43:58,726 INFO L225 Difference]: With dead ends: 4594 [2018-11-28 19:43:58,726 INFO L226 Difference]: Without dead ends: 4594 [2018-11-28 19:43:58,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:43:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2018-11-28 19:43:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4400. [2018-11-28 19:43:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4400 states. [2018-11-28 19:43:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 9735 transitions. [2018-11-28 19:43:58,771 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 9735 transitions. Word has length 98 [2018-11-28 19:43:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:43:58,771 INFO L480 AbstractCegarLoop]: Abstraction has 4400 states and 9735 transitions. [2018-11-28 19:43:58,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:43:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 9735 transitions. [2018-11-28 19:43:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 19:43:58,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:43:58,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:43:58,776 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:43:58,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:43:58,777 INFO L82 PathProgramCache]: Analyzing trace with hash 738527215, now seen corresponding path program 4 times [2018-11-28 19:43:58,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:43:58,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:43:58,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:58,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:43:58,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:43:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:43:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:43:58,863 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 19:43:59,053 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 19:43:59,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:43:59 BasicIcfg [2018-11-28 19:43:59,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 19:43:59,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 19:43:59,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 19:43:59,057 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 19:43:59,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:43:10" (3/4) ... [2018-11-28 19:43:59,062 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 19:43:59,236 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 19:43:59,237 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 19:43:59,241 INFO L168 Benchmark]: Toolchain (without parser) took 51132.79 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -256.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,242 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 19:43:59,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 947.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.70 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,243 INFO L168 Benchmark]: Boogie Preprocessor took 47.02 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-11-28 19:43:59,243 INFO L168 Benchmark]: RCFGBuilder took 1218.75 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,243 INFO L168 Benchmark]: TraceAbstraction took 48657.92 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -187.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,244 INFO L168 Benchmark]: Witness Printer took 180.01 ms. Allocated memory is still 3.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-11-28 19:43:59,246 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 947.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.70 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.02 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 1218.75 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48657.92 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -187.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 180.01 ms. Allocated memory is still 3.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L681] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L689] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L691] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L692] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L693] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L694] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L702] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 pthread_t t251; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] FCALL, FORK -1 pthread_create(&t251, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t252; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] FCALL, FORK -1 pthread_create(&t252, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L752] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L754] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L757] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L801] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 48.4s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 24.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9381 SDtfs, 10432 SDslu, 20855 SDs, 0 SdLazy, 8360 SolverSat, 490 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 94 SyntacticMatches, 28 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34809occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 10.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 88725 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 2937 NumberOfCodeBlocks, 2937 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2803 ConstructedInterpolants, 0 QuantifiedInterpolants, 627444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...