./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe029_pso.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 26b2b2357b814182a8d4879b997bcd0cb02065f5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 00:33:54,211 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:33:54,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:33:54,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:33:54,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:33:54,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:33:54,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:33:54,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:33:54,231 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:33:54,232 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:33:54,233 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:33:54,234 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:33:54,235 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:33:54,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:33:54,237 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:33:54,238 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:33:54,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:33:54,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:33:54,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:33:54,244 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:33:54,245 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:33:54,246 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:33:54,249 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:33:54,249 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:33:54,249 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:33:54,250 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:33:54,251 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:33:54,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:33:54,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:33:54,254 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:33:54,254 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:33:54,255 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:33:54,255 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:33:54,255 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:33:54,256 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:33:54,257 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:33:54,258 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:33:54,272 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:33:54,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:33:54,274 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:33:54,274 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:33:54,274 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:33:54,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:33:54,275 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:33:54,275 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:33:54,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:33:54,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:33:54,276 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:33:54,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:33:54,276 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:33:54,276 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:33:54,276 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:33:54,276 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:33:54,277 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:33:54,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:33:54,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:33:54,277 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:33:54,277 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:33:54,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:33:54,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:33:54,278 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:33:54,278 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:33:54,278 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:33:54,278 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:33:54,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:33:54,279 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 -> 26b2b2357b814182a8d4879b997bcd0cb02065f5 [2019-01-01 00:33:54,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:33:54,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:33:54,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:33:54,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:33:54,365 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:33:54,366 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i [2019-01-01 00:33:54,435 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c00329e5/c3158fe287e14ab6b8f7a7d76990ec1b/FLAG9ba32aa3d [2019-01-01 00:33:55,019 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:33:55,020 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i [2019-01-01 00:33:55,044 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c00329e5/c3158fe287e14ab6b8f7a7d76990ec1b/FLAG9ba32aa3d [2019-01-01 00:33:55,278 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c00329e5/c3158fe287e14ab6b8f7a7d76990ec1b [2019-01-01 00:33:55,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:33:55,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:33:55,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:33:55,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:33:55,289 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:33:55,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:33:55" (1/1) ... [2019-01-01 00:33:55,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46468b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:55, skipping insertion in model container [2019-01-01 00:33:55,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:33:55" (1/1) ... [2019-01-01 00:33:55,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:33:55,370 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:33:55,918 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:33:55,937 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:33:56,092 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:33:56,179 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:33:56,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56 WrapperNode [2019-01-01 00:33:56,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:33:56,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:33:56,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:33:56,182 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:33:56,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (1/1) ... [2019-01-01 00:33:56,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (1/1) ... [2019-01-01 00:33:56,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:33:56,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:33:56,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:33:56,277 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:33:56,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (1/1) ... [2019-01-01 00:33:56,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (1/1) ... [2019-01-01 00:33:56,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (1/1) ... [2019-01-01 00:33:56,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (1/1) ... [2019-01-01 00:33:56,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (1/1) ... [2019-01-01 00:33:56,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (1/1) ... [2019-01-01 00:33:56,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (1/1) ... [2019-01-01 00:33:56,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:33:56,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:33:56,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:33:56,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:33:56,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (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 [2019-01-01 00:33:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:33:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:33:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:33:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:33:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:33:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:33:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:33:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:33:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:33:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:33:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:33:56,406 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:33:57,599 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:33:57,600 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 00:33:57,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:33:57 BoogieIcfgContainer [2019-01-01 00:33:57,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:33:57,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:33:57,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:33:57,606 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:33:57,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:33:55" (1/3) ... [2019-01-01 00:33:57,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189ce626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:33:57, skipping insertion in model container [2019-01-01 00:33:57,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:33:56" (2/3) ... [2019-01-01 00:33:57,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189ce626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:33:57, skipping insertion in model container [2019-01-01 00:33:57,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:33:57" (3/3) ... [2019-01-01 00:33:57,609 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc_false-unreach-call.i [2019-01-01 00:33:57,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,660 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,660 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,660 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,660 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,661 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,662 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,667 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,668 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,669 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,669 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,669 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,677 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,677 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,677 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,685 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,686 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:33:57,728 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:33:57,729 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:33:57,743 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 00:33:57,763 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 00:33:57,788 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:33:57,789 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:33:57,789 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:33:57,789 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:33:57,789 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:33:57,789 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:33:57,790 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:33:57,790 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:33:57,790 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:33:57,808 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2019-01-01 00:33:59,548 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2019-01-01 00:33:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2019-01-01 00:33:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 00:33:59,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:33:59,560 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] [2019-01-01 00:33:59,562 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:33:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:33:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2019-01-01 00:33:59,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:33:59,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:33:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:59,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:33:59,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:33:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:33:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:33:59,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:33:59,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:33:59,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:33:59,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:33:59,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:33:59,993 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2019-01-01 00:34:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:01,041 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2019-01-01 00:34:01,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:34:01,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-01 00:34:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:01,371 INFO L225 Difference]: With dead ends: 45394 [2019-01-01 00:34:01,372 INFO L226 Difference]: Without dead ends: 40634 [2019-01-01 00:34:01,375 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 [2019-01-01 00:34:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2019-01-01 00:34:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2019-01-01 00:34:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2019-01-01 00:34:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2019-01-01 00:34:03,027 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2019-01-01 00:34:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:03,029 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2019-01-01 00:34:03,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2019-01-01 00:34:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 00:34:03,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:03,046 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] [2019-01-01 00:34:03,047 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:03,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:03,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2019-01-01 00:34:03,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:03,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:03,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:03,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:03,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:03,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:03,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:34:03,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:34:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:34:03,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:03,377 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2019-01-01 00:34:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:06,053 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2019-01-01 00:34:06,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:34:06,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-01-01 00:34:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:06,514 INFO L225 Difference]: With dead ends: 64836 [2019-01-01 00:34:06,514 INFO L226 Difference]: Without dead ends: 64676 [2019-01-01 00:34:06,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:34:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2019-01-01 00:34:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2019-01-01 00:34:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2019-01-01 00:34:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2019-01-01 00:34:08,291 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2019-01-01 00:34:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:08,293 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2019-01-01 00:34:08,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:34:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2019-01-01 00:34:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 00:34:08,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:08,297 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] [2019-01-01 00:34:08,298 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2019-01-01 00:34:08,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:08,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:08,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:08,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:08,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:08,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:08,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:08,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:08,447 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2019-01-01 00:34:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:08,548 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2019-01-01 00:34:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:34:08,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-01 00:34:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:08,575 INFO L225 Difference]: With dead ends: 12370 [2019-01-01 00:34:08,575 INFO L226 Difference]: Without dead ends: 11849 [2019-01-01 00:34:08,576 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 [2019-01-01 00:34:08,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2019-01-01 00:34:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2019-01-01 00:34:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2019-01-01 00:34:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2019-01-01 00:34:08,849 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2019-01-01 00:34:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:08,850 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2019-01-01 00:34:08,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2019-01-01 00:34:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 00:34:08,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:08,857 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] [2019-01-01 00:34:08,857 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:08,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:08,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2019-01-01 00:34:08,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:08,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:08,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:08,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:09,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:09,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:09,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:09,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:09,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:09,005 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2019-01-01 00:34:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:09,423 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2019-01-01 00:34:09,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:34:09,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-01 00:34:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:09,458 INFO L225 Difference]: With dead ends: 17025 [2019-01-01 00:34:09,459 INFO L226 Difference]: Without dead ends: 17025 [2019-01-01 00:34:09,459 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 [2019-01-01 00:34:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2019-01-01 00:34:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2019-01-01 00:34:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2019-01-01 00:34:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2019-01-01 00:34:09,783 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2019-01-01 00:34:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:09,784 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2019-01-01 00:34:09,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2019-01-01 00:34:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 00:34:09,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:09,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:34:09,794 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2019-01-01 00:34:09,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:09,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:09,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:09,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:09,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:10,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:10,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:10,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:10,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:10,020 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2019-01-01 00:34:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:11,435 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2019-01-01 00:34:11,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:34:11,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-01 00:34:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:11,472 INFO L225 Difference]: With dead ends: 18380 [2019-01-01 00:34:11,472 INFO L226 Difference]: Without dead ends: 18380 [2019-01-01 00:34:11,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2019-01-01 00:34:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2019-01-01 00:34:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2019-01-01 00:34:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2019-01-01 00:34:11,776 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2019-01-01 00:34:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:11,776 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2019-01-01 00:34:11,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2019-01-01 00:34:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 00:34:11,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:11,785 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] [2019-01-01 00:34:11,785 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:11,786 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2019-01-01 00:34:11,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:11,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:11,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:11,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:11,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:11,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:11,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:11,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:11,967 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2019-01-01 00:34:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:12,557 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2019-01-01 00:34:12,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:34:12,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-01 00:34:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:12,593 INFO L225 Difference]: With dead ends: 17857 [2019-01-01 00:34:12,593 INFO L226 Difference]: Without dead ends: 17857 [2019-01-01 00:34:12,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:34:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2019-01-01 00:34:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2019-01-01 00:34:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2019-01-01 00:34:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2019-01-01 00:34:12,901 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2019-01-01 00:34:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:12,901 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2019-01-01 00:34:12,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2019-01-01 00:34:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 00:34:12,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:12,911 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] [2019-01-01 00:34:12,912 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2019-01-01 00:34:12,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:12,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:12,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:12,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:12,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:13,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:13,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:13,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:13,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:13,247 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2019-01-01 00:34:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:14,253 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2019-01-01 00:34:14,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 00:34:14,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-01 00:34:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:14,307 INFO L225 Difference]: With dead ends: 23475 [2019-01-01 00:34:14,308 INFO L226 Difference]: Without dead ends: 23443 [2019-01-01 00:34:14,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-01 00:34:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2019-01-01 00:34:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2019-01-01 00:34:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2019-01-01 00:34:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2019-01-01 00:34:15,038 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2019-01-01 00:34:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:15,038 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2019-01-01 00:34:15,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2019-01-01 00:34:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:34:15,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:15,071 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] [2019-01-01 00:34:15,071 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:15,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2019-01-01 00:34:15,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:15,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:15,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:15,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:15,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:15,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:15,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:15,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:15,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:15,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:15,238 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2019-01-01 00:34:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:16,290 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2019-01-01 00:34:16,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 00:34:16,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-01-01 00:34:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:16,337 INFO L225 Difference]: With dead ends: 24535 [2019-01-01 00:34:16,337 INFO L226 Difference]: Without dead ends: 24471 [2019-01-01 00:34:16,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-01 00:34:16,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2019-01-01 00:34:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2019-01-01 00:34:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2019-01-01 00:34:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2019-01-01 00:34:16,673 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2019-01-01 00:34:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:16,674 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2019-01-01 00:34:16,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2019-01-01 00:34:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-01 00:34:16,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:16,699 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] [2019-01-01 00:34:16,699 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2019-01-01 00:34:16,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:16,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:16,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:16,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:16,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:16,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:16,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:34:16,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:34:16,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:34:16,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:34:16,778 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2019-01-01 00:34:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:17,193 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2019-01-01 00:34:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:34:17,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-01 00:34:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:17,255 INFO L225 Difference]: With dead ends: 24947 [2019-01-01 00:34:17,255 INFO L226 Difference]: Without dead ends: 24947 [2019-01-01 00:34:17,256 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 [2019-01-01 00:34:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2019-01-01 00:34:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2019-01-01 00:34:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2019-01-01 00:34:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2019-01-01 00:34:17,768 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2019-01-01 00:34:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:17,769 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2019-01-01 00:34:17,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:34:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2019-01-01 00:34:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-01 00:34:17,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:17,809 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] [2019-01-01 00:34:17,810 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:17,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2019-01-01 00:34:17,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:17,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:17,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:17,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:17,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:18,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:18,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:18,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:18,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:18,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:18,084 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2019-01-01 00:34:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:18,966 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2019-01-01 00:34:18,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:34:18,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-01-01 00:34:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:19,044 INFO L225 Difference]: With dead ends: 34667 [2019-01-01 00:34:19,045 INFO L226 Difference]: Without dead ends: 34471 [2019-01-01 00:34:19,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2019-01-01 00:34:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2019-01-01 00:34:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2019-01-01 00:34:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2019-01-01 00:34:19,654 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2019-01-01 00:34:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:19,654 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2019-01-01 00:34:19,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2019-01-01 00:34:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-01 00:34:19,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:19,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:34:19,694 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:19,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2019-01-01 00:34:19,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:19,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:19,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:19,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:19,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:19,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:19,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:19,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:19,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:19,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:19,894 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2019-01-01 00:34:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:21,280 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2019-01-01 00:34:21,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:34:21,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-01-01 00:34:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:21,388 INFO L225 Difference]: With dead ends: 52152 [2019-01-01 00:34:21,388 INFO L226 Difference]: Without dead ends: 51912 [2019-01-01 00:34:21,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:34:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2019-01-01 00:34:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2019-01-01 00:34:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2019-01-01 00:34:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2019-01-01 00:34:22,152 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2019-01-01 00:34:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:22,153 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2019-01-01 00:34:22,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2019-01-01 00:34:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-01 00:34:22,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:22,201 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] [2019-01-01 00:34:22,201 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:22,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2019-01-01 00:34:22,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:22,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:22,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:22,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:22,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:22,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:22,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:34:22,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:34:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:34:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:22,428 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2019-01-01 00:34:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:22,745 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2019-01-01 00:34:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:34:22,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-01-01 00:34:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:22,755 INFO L225 Difference]: With dead ends: 5456 [2019-01-01 00:34:22,756 INFO L226 Difference]: Without dead ends: 4832 [2019-01-01 00:34:22,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2019-01-01 00:34:22,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2019-01-01 00:34:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-01-01 00:34:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2019-01-01 00:34:22,839 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2019-01-01 00:34:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:22,839 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2019-01-01 00:34:22,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:34:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2019-01-01 00:34:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:34:22,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:22,849 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] [2019-01-01 00:34:22,849 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1415378869, now seen corresponding path program 1 times [2019-01-01 00:34:22,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:22,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:22,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:22,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:22,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:23,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:23,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:34:23,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:34:23,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:34:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:23,047 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2019-01-01 00:34:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:23,318 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2019-01-01 00:34:23,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:34:23,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-01 00:34:23,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:23,326 INFO L225 Difference]: With dead ends: 5468 [2019-01-01 00:34:23,327 INFO L226 Difference]: Without dead ends: 5440 [2019-01-01 00:34:23,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:34:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-01-01 00:34:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2019-01-01 00:34:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-01-01 00:34:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2019-01-01 00:34:23,389 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2019-01-01 00:34:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:23,390 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2019-01-01 00:34:23,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:34:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2019-01-01 00:34:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:34:23,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:23,398 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] [2019-01-01 00:34:23,398 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:23,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash -282188276, now seen corresponding path program 1 times [2019-01-01 00:34:23,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:23,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:23,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:23,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:23,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:23,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:23,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:34:23,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:34:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:34:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:34:23,526 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2019-01-01 00:34:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:23,668 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2019-01-01 00:34:23,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:34:23,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-01 00:34:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:23,677 INFO L225 Difference]: With dead ends: 5440 [2019-01-01 00:34:23,677 INFO L226 Difference]: Without dead ends: 5440 [2019-01-01 00:34:23,677 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 [2019-01-01 00:34:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-01-01 00:34:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2019-01-01 00:34:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2019-01-01 00:34:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2019-01-01 00:34:23,741 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2019-01-01 00:34:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:23,742 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2019-01-01 00:34:23,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:34:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2019-01-01 00:34:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:23,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:23,749 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] [2019-01-01 00:34:23,750 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:23,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash -203880528, now seen corresponding path program 1 times [2019-01-01 00:34:23,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:23,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:23,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:23,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:23,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:23,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:23,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:23,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:23,917 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 4 states. [2019-01-01 00:34:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:24,082 INFO L93 Difference]: Finished difference Result 9734 states and 25760 transitions. [2019-01-01 00:34:24,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:34:24,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-01 00:34:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:24,103 INFO L225 Difference]: With dead ends: 9734 [2019-01-01 00:34:24,103 INFO L226 Difference]: Without dead ends: 9706 [2019-01-01 00:34:24,103 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 [2019-01-01 00:34:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-01-01 00:34:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 5140. [2019-01-01 00:34:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2019-01-01 00:34:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13376 transitions. [2019-01-01 00:34:24,185 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13376 transitions. Word has length 91 [2019-01-01 00:34:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:24,185 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13376 transitions. [2019-01-01 00:34:24,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13376 transitions. [2019-01-01 00:34:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:24,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:24,191 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] [2019-01-01 00:34:24,192 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:24,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:24,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1904621007, now seen corresponding path program 1 times [2019-01-01 00:34:24,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:24,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:24,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:24,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:24,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:24,532 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 00:34:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:24,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:24,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:24,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:24,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:24,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:24,709 INFO L87 Difference]: Start difference. First operand 5140 states and 13376 transitions. Second operand 6 states. [2019-01-01 00:34:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:25,120 INFO L93 Difference]: Finished difference Result 5643 states and 14543 transitions. [2019-01-01 00:34:25,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:34:25,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:34:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:25,129 INFO L225 Difference]: With dead ends: 5643 [2019-01-01 00:34:25,130 INFO L226 Difference]: Without dead ends: 5643 [2019-01-01 00:34:25,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:25,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2019-01-01 00:34:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5222. [2019-01-01 00:34:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-01-01 00:34:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 13576 transitions. [2019-01-01 00:34:25,195 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 13576 transitions. Word has length 91 [2019-01-01 00:34:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:25,196 INFO L480 AbstractCegarLoop]: Abstraction has 5222 states and 13576 transitions. [2019-01-01 00:34:25,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 13576 transitions. [2019-01-01 00:34:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:25,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:25,205 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] [2019-01-01 00:34:25,205 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:25,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:25,205 INFO L82 PathProgramCache]: Analyzing trace with hash -935039984, now seen corresponding path program 1 times [2019-01-01 00:34:25,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:25,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:25,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:25,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:25,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:25,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:25,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:25,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:25,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:25,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:25,434 INFO L87 Difference]: Start difference. First operand 5222 states and 13576 transitions. Second operand 7 states. [2019-01-01 00:34:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:25,826 INFO L93 Difference]: Finished difference Result 5203 states and 13406 transitions. [2019-01-01 00:34:25,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:34:25,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:34:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:25,835 INFO L225 Difference]: With dead ends: 5203 [2019-01-01 00:34:25,836 INFO L226 Difference]: Without dead ends: 5178 [2019-01-01 00:34:25,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:34:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2019-01-01 00:34:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 4801. [2019-01-01 00:34:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2019-01-01 00:34:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 12542 transitions. [2019-01-01 00:34:25,901 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 12542 transitions. Word has length 91 [2019-01-01 00:34:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:25,901 INFO L480 AbstractCegarLoop]: Abstraction has 4801 states and 12542 transitions. [2019-01-01 00:34:25,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 12542 transitions. [2019-01-01 00:34:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:25,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:25,908 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] [2019-01-01 00:34:25,908 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:25,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:25,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1383736623, now seen corresponding path program 1 times [2019-01-01 00:34:25,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:25,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:25,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:25,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:25,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:26,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:26,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:26,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:26,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:26,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:26,139 INFO L87 Difference]: Start difference. First operand 4801 states and 12542 transitions. Second operand 6 states. [2019-01-01 00:34:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:26,401 INFO L93 Difference]: Finished difference Result 4393 states and 11483 transitions. [2019-01-01 00:34:26,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:34:26,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:34:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:26,410 INFO L225 Difference]: With dead ends: 4393 [2019-01-01 00:34:26,410 INFO L226 Difference]: Without dead ends: 4393 [2019-01-01 00:34:26,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:34:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-01-01 00:34:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 4259. [2019-01-01 00:34:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4259 states. [2019-01-01 00:34:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 11187 transitions. [2019-01-01 00:34:26,500 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 11187 transitions. Word has length 91 [2019-01-01 00:34:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:26,501 INFO L480 AbstractCegarLoop]: Abstraction has 4259 states and 11187 transitions. [2019-01-01 00:34:26,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 11187 transitions. [2019-01-01 00:34:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:26,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:26,506 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] [2019-01-01 00:34:26,507 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash -82841607, now seen corresponding path program 1 times [2019-01-01 00:34:26,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:26,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:26,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:26,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:26,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:26,983 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-01 00:34:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:27,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:27,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:27,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:27,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:27,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:27,001 INFO L87 Difference]: Start difference. First operand 4259 states and 11187 transitions. Second operand 6 states. [2019-01-01 00:34:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:27,334 INFO L93 Difference]: Finished difference Result 5737 states and 14773 transitions. [2019-01-01 00:34:27,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:34:27,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:34:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:27,343 INFO L225 Difference]: With dead ends: 5737 [2019-01-01 00:34:27,343 INFO L226 Difference]: Without dead ends: 5705 [2019-01-01 00:34:27,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2019-01-01 00:34:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 4600. [2019-01-01 00:34:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4600 states. [2019-01-01 00:34:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 11989 transitions. [2019-01-01 00:34:27,402 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 11989 transitions. Word has length 91 [2019-01-01 00:34:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:27,403 INFO L480 AbstractCegarLoop]: Abstraction has 4600 states and 11989 transitions. [2019-01-01 00:34:27,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 11989 transitions. [2019-01-01 00:34:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:27,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:27,408 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] [2019-01-01 00:34:27,408 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash -365992071, now seen corresponding path program 1 times [2019-01-01 00:34:27,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:27,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:27,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:27,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:27,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:27,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:27,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:27,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:27,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:27,574 INFO L87 Difference]: Start difference. First operand 4600 states and 11989 transitions. Second operand 7 states. [2019-01-01 00:34:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:28,011 INFO L93 Difference]: Finished difference Result 8360 states and 22331 transitions. [2019-01-01 00:34:28,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 00:34:28,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:34:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:28,025 INFO L225 Difference]: With dead ends: 8360 [2019-01-01 00:34:28,025 INFO L226 Difference]: Without dead ends: 8360 [2019-01-01 00:34:28,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:34:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8360 states. [2019-01-01 00:34:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8360 to 5036. [2019-01-01 00:34:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5036 states. [2019-01-01 00:34:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 13135 transitions. [2019-01-01 00:34:28,111 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 13135 transitions. Word has length 91 [2019-01-01 00:34:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:28,111 INFO L480 AbstractCegarLoop]: Abstraction has 5036 states and 13135 transitions. [2019-01-01 00:34:28,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 13135 transitions. [2019-01-01 00:34:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:28,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:28,118 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] [2019-01-01 00:34:28,118 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash 878772410, now seen corresponding path program 1 times [2019-01-01 00:34:28,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:28,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:28,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:28,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:28,548 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2019-01-01 00:34:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:28,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:28,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:28,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:28,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:28,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:28,639 INFO L87 Difference]: Start difference. First operand 5036 states and 13135 transitions. Second operand 6 states. [2019-01-01 00:34:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:28,718 INFO L93 Difference]: Finished difference Result 7806 states and 20863 transitions. [2019-01-01 00:34:28,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:34:28,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:34:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:28,730 INFO L225 Difference]: With dead ends: 7806 [2019-01-01 00:34:28,730 INFO L226 Difference]: Without dead ends: 7806 [2019-01-01 00:34:28,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7806 states. [2019-01-01 00:34:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7806 to 4716. [2019-01-01 00:34:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-01-01 00:34:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 12277 transitions. [2019-01-01 00:34:28,801 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 12277 transitions. Word has length 91 [2019-01-01 00:34:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:28,802 INFO L480 AbstractCegarLoop]: Abstraction has 4716 states and 12277 transitions. [2019-01-01 00:34:28,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 12277 transitions. [2019-01-01 00:34:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:28,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:28,808 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] [2019-01-01 00:34:28,809 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:28,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1359488826, now seen corresponding path program 1 times [2019-01-01 00:34:28,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:28,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:28,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:28,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:28,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:29,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:29,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:29,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:29,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:29,172 INFO L87 Difference]: Start difference. First operand 4716 states and 12277 transitions. Second operand 6 states. [2019-01-01 00:34:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:29,392 INFO L93 Difference]: Finished difference Result 4076 states and 10405 transitions. [2019-01-01 00:34:29,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:34:29,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:34:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:29,399 INFO L225 Difference]: With dead ends: 4076 [2019-01-01 00:34:29,400 INFO L226 Difference]: Without dead ends: 4076 [2019-01-01 00:34:29,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:34:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2019-01-01 00:34:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3489. [2019-01-01 00:34:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2019-01-01 00:34:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 9041 transitions. [2019-01-01 00:34:29,444 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 9041 transitions. Word has length 91 [2019-01-01 00:34:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:29,444 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 9041 transitions. [2019-01-01 00:34:29,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 9041 transitions. [2019-01-01 00:34:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:29,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:29,449 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] [2019-01-01 00:34:29,449 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:29,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1413527866, now seen corresponding path program 1 times [2019-01-01 00:34:29,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:29,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:29,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:29,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:29,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:29,607 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 00:34:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:29,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:29,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:29,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:30,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:30,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:30,001 INFO L87 Difference]: Start difference. First operand 3489 states and 9041 transitions. Second operand 6 states. [2019-01-01 00:34:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:30,751 INFO L93 Difference]: Finished difference Result 3702 states and 9446 transitions. [2019-01-01 00:34:30,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:34:30,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-01 00:34:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:30,758 INFO L225 Difference]: With dead ends: 3702 [2019-01-01 00:34:30,758 INFO L226 Difference]: Without dead ends: 3657 [2019-01-01 00:34:30,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2019-01-01 00:34:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3597. [2019-01-01 00:34:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2019-01-01 00:34:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9246 transitions. [2019-01-01 00:34:30,801 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9246 transitions. Word has length 93 [2019-01-01 00:34:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:30,801 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9246 transitions. [2019-01-01 00:34:30,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9246 transitions. [2019-01-01 00:34:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:30,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:30,805 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] [2019-01-01 00:34:30,805 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:30,806 INFO L82 PathProgramCache]: Analyzing trace with hash -522132421, now seen corresponding path program 1 times [2019-01-01 00:34:30,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:30,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:30,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:30,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:30,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:30,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:30,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:30,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:30,968 INFO L87 Difference]: Start difference. First operand 3597 states and 9246 transitions. Second operand 7 states. [2019-01-01 00:34:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:34,088 INFO L93 Difference]: Finished difference Result 5508 states and 13847 transitions. [2019-01-01 00:34:34,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 00:34:34,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:34:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:34,097 INFO L225 Difference]: With dead ends: 5508 [2019-01-01 00:34:34,097 INFO L226 Difference]: Without dead ends: 5476 [2019-01-01 00:34:34,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-01 00:34:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2019-01-01 00:34:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 4226. [2019-01-01 00:34:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4226 states. [2019-01-01 00:34:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 10779 transitions. [2019-01-01 00:34:34,157 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 10779 transitions. Word has length 93 [2019-01-01 00:34:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:34,157 INFO L480 AbstractCegarLoop]: Abstraction has 4226 states and 10779 transitions. [2019-01-01 00:34:34,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 10779 transitions. [2019-01-01 00:34:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:34,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:34,165 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] [2019-01-01 00:34:34,166 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:34,166 INFO L82 PathProgramCache]: Analyzing trace with hash 722632060, now seen corresponding path program 1 times [2019-01-01 00:34:34,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:34,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:34,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:34,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:34,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:34,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:34,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:34,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:34,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:34,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:34,401 INFO L87 Difference]: Start difference. First operand 4226 states and 10779 transitions. Second operand 6 states. [2019-01-01 00:34:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:34,551 INFO L93 Difference]: Finished difference Result 4301 states and 10863 transitions. [2019-01-01 00:34:34,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:34:34,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-01 00:34:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:34,558 INFO L225 Difference]: With dead ends: 4301 [2019-01-01 00:34:34,558 INFO L226 Difference]: Without dead ends: 4301 [2019-01-01 00:34:34,559 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 [2019-01-01 00:34:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2019-01-01 00:34:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4171. [2019-01-01 00:34:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2019-01-01 00:34:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 10618 transitions. [2019-01-01 00:34:34,609 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 10618 transitions. Word has length 93 [2019-01-01 00:34:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:34,609 INFO L480 AbstractCegarLoop]: Abstraction has 4171 states and 10618 transitions. [2019-01-01 00:34:34,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 10618 transitions. [2019-01-01 00:34:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:34,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:34,614 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] [2019-01-01 00:34:34,614 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:34,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:34,615 INFO L82 PathProgramCache]: Analyzing trace with hash -192366660, now seen corresponding path program 1 times [2019-01-01 00:34:34,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:34,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:34,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:34,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:34,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:34,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:34,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:34:34,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:34:34,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:34:34,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:34,801 INFO L87 Difference]: Start difference. First operand 4171 states and 10618 transitions. Second operand 5 states. [2019-01-01 00:34:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:35,056 INFO L93 Difference]: Finished difference Result 4715 states and 11962 transitions. [2019-01-01 00:34:35,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:34:35,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-01 00:34:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:35,064 INFO L225 Difference]: With dead ends: 4715 [2019-01-01 00:34:35,064 INFO L226 Difference]: Without dead ends: 4683 [2019-01-01 00:34:35,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2019-01-01 00:34:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 3650. [2019-01-01 00:34:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3650 states. [2019-01-01 00:34:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 9341 transitions. [2019-01-01 00:34:35,115 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 9341 transitions. Word has length 93 [2019-01-01 00:34:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:35,115 INFO L480 AbstractCegarLoop]: Abstraction has 3650 states and 9341 transitions. [2019-01-01 00:34:35,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:34:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 9341 transitions. [2019-01-01 00:34:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:35,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:35,120 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] [2019-01-01 00:34:35,121 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1052397821, now seen corresponding path program 1 times [2019-01-01 00:34:35,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:35,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:35,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:35,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:35,353 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 00:34:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:35,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:35,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:35,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:35,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:35,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:35,565 INFO L87 Difference]: Start difference. First operand 3650 states and 9341 transitions. Second operand 7 states. [2019-01-01 00:34:35,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:35,872 INFO L93 Difference]: Finished difference Result 5475 states and 14168 transitions. [2019-01-01 00:34:35,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:34:35,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:34:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:35,876 INFO L225 Difference]: With dead ends: 5475 [2019-01-01 00:34:35,876 INFO L226 Difference]: Without dead ends: 1974 [2019-01-01 00:34:35,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:34:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-01-01 00:34:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1974. [2019-01-01 00:34:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2019-01-01 00:34:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 5105 transitions. [2019-01-01 00:34:35,900 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 5105 transitions. Word has length 93 [2019-01-01 00:34:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:35,900 INFO L480 AbstractCegarLoop]: Abstraction has 1974 states and 5105 transitions. [2019-01-01 00:34:35,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 5105 transitions. [2019-01-01 00:34:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:35,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:35,903 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] [2019-01-01 00:34:35,903 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:35,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:35,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1042938802, now seen corresponding path program 1 times [2019-01-01 00:34:35,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:35,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:35,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:36,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:36,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:36,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:36,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:36,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:36,045 INFO L87 Difference]: Start difference. First operand 1974 states and 5105 transitions. Second operand 7 states. [2019-01-01 00:34:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:36,225 INFO L93 Difference]: Finished difference Result 1988 states and 5137 transitions. [2019-01-01 00:34:36,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:34:36,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:34:36,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:36,230 INFO L225 Difference]: With dead ends: 1988 [2019-01-01 00:34:36,230 INFO L226 Difference]: Without dead ends: 1988 [2019-01-01 00:34:36,231 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 [2019-01-01 00:34:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2019-01-01 00:34:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1950. [2019-01-01 00:34:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-01-01 00:34:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5057 transitions. [2019-01-01 00:34:36,253 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5057 transitions. Word has length 93 [2019-01-01 00:34:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:36,254 INFO L480 AbstractCegarLoop]: Abstraction has 1950 states and 5057 transitions. [2019-01-01 00:34:36,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5057 transitions. [2019-01-01 00:34:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:36,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:36,256 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] [2019-01-01 00:34:36,257 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:36,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:36,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1157749772, now seen corresponding path program 2 times [2019-01-01 00:34:36,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:36,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:36,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:36,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:36,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:36,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:36,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 00:34:36,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 00:34:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 00:34:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:34:36,471 INFO L87 Difference]: Start difference. First operand 1950 states and 5057 transitions. Second operand 8 states. [2019-01-01 00:34:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:36,972 INFO L93 Difference]: Finished difference Result 2282 states and 5776 transitions. [2019-01-01 00:34:36,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:34:36,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-01-01 00:34:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:36,978 INFO L225 Difference]: With dead ends: 2282 [2019-01-01 00:34:36,978 INFO L226 Difference]: Without dead ends: 2253 [2019-01-01 00:34:36,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:34:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-01-01 00:34:36,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1942. [2019-01-01 00:34:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-01-01 00:34:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 5031 transitions. [2019-01-01 00:34:37,003 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 5031 transitions. Word has length 93 [2019-01-01 00:34:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:37,003 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 5031 transitions. [2019-01-01 00:34:37,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 00:34:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 5031 transitions. [2019-01-01 00:34:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:37,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:37,006 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] [2019-01-01 00:34:37,007 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:37,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:37,007 INFO L82 PathProgramCache]: Analyzing trace with hash -777910515, now seen corresponding path program 2 times [2019-01-01 00:34:37,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:37,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:37,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:34:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:37,243 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 00:34:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:34:37,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:37,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 00:34:37,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 00:34:37,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 00:34:37,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:34:37,551 INFO L87 Difference]: Start difference. First operand 1942 states and 5031 transitions. Second operand 12 states. [2019-01-01 00:34:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:38,185 INFO L93 Difference]: Finished difference Result 3699 states and 9678 transitions. [2019-01-01 00:34:38,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 00:34:38,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-01 00:34:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:38,190 INFO L225 Difference]: With dead ends: 3699 [2019-01-01 00:34:38,190 INFO L226 Difference]: Without dead ends: 2563 [2019-01-01 00:34:38,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-01 00:34:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2019-01-01 00:34:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2411. [2019-01-01 00:34:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-01-01 00:34:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6104 transitions. [2019-01-01 00:34:38,219 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6104 transitions. Word has length 93 [2019-01-01 00:34:38,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:38,219 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 6104 transitions. [2019-01-01 00:34:38,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 00:34:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6104 transitions. [2019-01-01 00:34:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:38,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:38,223 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] [2019-01-01 00:34:38,223 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:38,223 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2019-01-01 00:34:38,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:38,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:38,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:38,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:34:38,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:34:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:34:38,326 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:34:38,518 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:34:38,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:34:38 BasicIcfg [2019-01-01 00:34:38,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:34:38,521 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:34:38,521 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:34:38,522 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:34:38,522 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:33:57" (3/4) ... [2019-01-01 00:34:38,528 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:34:38,739 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:34:38,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:34:38,740 INFO L168 Benchmark]: Toolchain (without parser) took 43457.29 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -246.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-01 00:34:38,742 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:34:38,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 896.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:34:38,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.49 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. [2019-01-01 00:34:38,743 INFO L168 Benchmark]: Boogie Preprocessor took 40.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. [2019-01-01 00:34:38,743 INFO L168 Benchmark]: RCFGBuilder took 1283.49 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.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2019-01-01 00:34:38,743 INFO L168 Benchmark]: TraceAbstraction took 40918.79 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -183.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-01 00:34:38,747 INFO L168 Benchmark]: Witness Printer took 217.74 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: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:34:38,751 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 896.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.49 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 40.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 1283.49 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.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40918.79 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -183.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 217.74 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: 40.8 MB). Peak memory consumption was 40.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] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] -1 pthread_t t2479; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] FCALL, FORK -1 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2480; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 x = 2 [L728] 1 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L718] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L774] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L775] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L776] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 40.7s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7076 SDtfs, 6294 SDslu, 16018 SDs, 0 SdLazy, 6614 SolverSat, 377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 85 SyntacticMatches, 16 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 92793 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2453 NumberOfCodeBlocks, 2453 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2330 ConstructedInterpolants, 0 QuantifiedInterpolants, 460278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...