./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread/triangular-longer_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/triangular-longer_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 5c411f7a0e92322da42b7e0fe2dbd9719b462a69 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-12 22:19:43,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 22:19:43,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 22:19:43,219 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 22:19:43,219 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 22:19:43,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 22:19:43,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 22:19:43,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 22:19:43,232 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 22:19:43,233 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 22:19:43,233 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 22:19:43,234 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 22:19:43,235 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 22:19:43,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 22:19:43,237 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 22:19:43,238 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 22:19:43,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 22:19:43,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 22:19:43,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 22:19:43,244 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 22:19:43,245 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 22:19:43,250 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 22:19:43,255 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 22:19:43,257 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 22:19:43,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 22:19:43,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 22:19:43,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 22:19:43,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 22:19:43,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 22:19:43,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 22:19:43,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 22:19:43,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 22:19:43,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 22:19:43,267 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 22:19:43,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 22:19:43,271 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 22:19:43,272 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 22:19:43,304 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 22:19:43,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 22:19:43,306 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 22:19:43,307 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 22:19:43,307 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 22:19:43,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 22:19:43,307 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 22:19:43,307 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 22:19:43,308 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 22:19:43,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 22:19:43,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 22:19:43,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 22:19:43,308 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 22:19:43,308 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 22:19:43,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 22:19:43,309 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 22:19:43,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 22:19:43,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 22:19:43,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 22:19:43,309 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 22:19:43,310 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 22:19:43,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:19:43,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 22:19:43,310 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 22:19:43,310 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 22:19:43,311 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 22:19:43,311 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 22:19:43,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 22:19:43,311 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 -> 5c411f7a0e92322da42b7e0fe2dbd9719b462a69 [2019-01-12 22:19:43,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 22:19:43,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 22:19:43,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 22:19:43,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 22:19:43,395 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 22:19:43,397 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread/triangular-longer_false-unreach-call.i [2019-01-12 22:19:43,461 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1edb79fe/3db20dbb733e4cf3be8d97251d101c41/FLAG5e963908c [2019-01-12 22:19:43,946 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 22:19:43,947 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread/triangular-longer_false-unreach-call.i [2019-01-12 22:19:43,974 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1edb79fe/3db20dbb733e4cf3be8d97251d101c41/FLAG5e963908c [2019-01-12 22:19:44,230 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1edb79fe/3db20dbb733e4cf3be8d97251d101c41 [2019-01-12 22:19:44,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 22:19:44,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 22:19:44,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 22:19:44,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 22:19:44,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 22:19:44,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:44,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b035c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44, skipping insertion in model container [2019-01-12 22:19:44,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:44,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 22:19:44,313 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 22:19:44,688 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:19:44,699 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 22:19:44,853 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:19:44,938 INFO L195 MainTranslator]: Completed translation [2019-01-12 22:19:44,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44 WrapperNode [2019-01-12 22:19:44,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 22:19:44,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 22:19:44,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 22:19:44,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 22:19:44,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:44,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:44,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 22:19:44,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 22:19:44,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 22:19:44,998 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 22:19:45,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:45,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:45,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:45,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:45,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:45,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:45,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (1/1) ... [2019-01-12 22:19:45,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 22:19:45,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 22:19:45,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 22:19:45,055 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 22:19:45,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (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-12 22:19:45,130 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-01-12 22:19:45,132 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-01-12 22:19:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-01-12 22:19:45,133 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-01-12 22:19:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 22:19:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 22:19:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 22:19:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 22:19:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 22:19:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 22:19:45,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 22:19:45,137 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 22:19:45,660 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 22:19:45,661 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-12 22:19:45,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:19:45 BoogieIcfgContainer [2019-01-12 22:19:45,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 22:19:45,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 22:19:45,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 22:19:45,668 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 22:19:45,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:19:44" (1/3) ... [2019-01-12 22:19:45,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e7a2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:19:45, skipping insertion in model container [2019-01-12 22:19:45,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:19:44" (2/3) ... [2019-01-12 22:19:45,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e7a2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:19:45, skipping insertion in model container [2019-01-12 22:19:45,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:19:45" (3/3) ... [2019-01-12 22:19:45,673 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer_false-unreach-call.i [2019-01-12 22:19:45,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,707 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,708 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,709 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,709 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,710 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,711 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,713 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,714 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,715 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,715 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,716 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,717 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,718 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,719 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:19:45,744 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 22:19:45,745 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 22:19:45,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 22:19:45,770 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 22:19:45,792 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 22:19:45,793 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 22:19:45,793 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 22:19:45,793 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 22:19:45,793 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 22:19:45,793 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 22:19:45,793 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 22:19:45,793 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 22:19:45,793 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 22:19:45,802 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46places, 48 transitions [2019-01-12 22:19:45,867 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1012 states. [2019-01-12 22:19:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states. [2019-01-12 22:19:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 22:19:45,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:45,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:19:45,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:45,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:45,892 INFO L82 PathProgramCache]: Analyzing trace with hash 573491188, now seen corresponding path program 1 times [2019-01-12 22:19:45,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:45,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:45,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:45,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:45,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:46,300 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-12 22:19:46,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:46,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:19:46,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:19:46,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:19:46,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:19:46,327 INFO L87 Difference]: Start difference. First operand 1012 states. Second operand 5 states. [2019-01-12 22:19:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:46,553 INFO L93 Difference]: Finished difference Result 1411 states and 4051 transitions. [2019-01-12 22:19:46,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:19:46,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-12 22:19:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:46,576 INFO L225 Difference]: With dead ends: 1411 [2019-01-12 22:19:46,578 INFO L226 Difference]: Without dead ends: 322 [2019-01-12 22:19:46,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:19:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-12 22:19:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-01-12 22:19:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-12 22:19:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 820 transitions. [2019-01-12 22:19:46,683 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 820 transitions. Word has length 19 [2019-01-12 22:19:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:46,685 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 820 transitions. [2019-01-12 22:19:46,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:19:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 820 transitions. [2019-01-12 22:19:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 22:19:46,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:46,689 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] [2019-01-12 22:19:46,689 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:46,690 INFO L82 PathProgramCache]: Analyzing trace with hash -143811728, now seen corresponding path program 1 times [2019-01-12 22:19:46,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:46,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:46,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:46,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:46,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:46,939 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-12 22:19:46,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:46,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:19:46,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:19:46,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:19:46,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:19:46,943 INFO L87 Difference]: Start difference. First operand 322 states and 820 transitions. Second operand 5 states. [2019-01-12 22:19:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:47,104 INFO L93 Difference]: Finished difference Result 411 states and 998 transitions. [2019-01-12 22:19:47,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:19:47,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 22:19:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:47,110 INFO L225 Difference]: With dead ends: 411 [2019-01-12 22:19:47,110 INFO L226 Difference]: Without dead ends: 290 [2019-01-12 22:19:47,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:19:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-12 22:19:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2019-01-12 22:19:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-01-12 22:19:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 714 transitions. [2019-01-12 22:19:47,132 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 714 transitions. Word has length 22 [2019-01-12 22:19:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:47,133 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 714 transitions. [2019-01-12 22:19:47,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:19:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 714 transitions. [2019-01-12 22:19:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 22:19:47,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:47,136 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] [2019-01-12 22:19:47,136 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:47,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:47,137 INFO L82 PathProgramCache]: Analyzing trace with hash 28324926, now seen corresponding path program 1 times [2019-01-12 22:19:47,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:47,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:47,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:47,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:47,301 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-12 22:19:47,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:47,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:19:47,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:19:47,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:19:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:19:47,303 INFO L87 Difference]: Start difference. First operand 290 states and 714 transitions. Second operand 6 states. [2019-01-12 22:19:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:47,456 INFO L93 Difference]: Finished difference Result 437 states and 1057 transitions. [2019-01-12 22:19:47,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:19:47,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-01-12 22:19:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:47,461 INFO L225 Difference]: With dead ends: 437 [2019-01-12 22:19:47,461 INFO L226 Difference]: Without dead ends: 309 [2019-01-12 22:19:47,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:19:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-12 22:19:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 299. [2019-01-12 22:19:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-01-12 22:19:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 732 transitions. [2019-01-12 22:19:47,482 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 732 transitions. Word has length 25 [2019-01-12 22:19:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:47,482 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 732 transitions. [2019-01-12 22:19:47,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:19:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 732 transitions. [2019-01-12 22:19:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 22:19:47,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:47,488 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] [2019-01-12 22:19:47,488 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash 19387626, now seen corresponding path program 2 times [2019-01-12 22:19:47,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:47,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:47,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:47,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:47,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:47,848 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-12 22:19:47,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:47,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:19:47,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:19:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:19:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:19:47,849 INFO L87 Difference]: Start difference. First operand 299 states and 732 transitions. Second operand 6 states. [2019-01-12 22:19:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:48,157 INFO L93 Difference]: Finished difference Result 456 states and 1095 transitions. [2019-01-12 22:19:48,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:19:48,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-01-12 22:19:48,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:48,163 INFO L225 Difference]: With dead ends: 456 [2019-01-12 22:19:48,163 INFO L226 Difference]: Without dead ends: 319 [2019-01-12 22:19:48,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:19:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-12 22:19:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2019-01-12 22:19:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-01-12 22:19:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 772 transitions. [2019-01-12 22:19:48,177 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 772 transitions. Word has length 25 [2019-01-12 22:19:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:48,178 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 772 transitions. [2019-01-12 22:19:48,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:19:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 772 transitions. [2019-01-12 22:19:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 22:19:48,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:48,181 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 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-12 22:19:48,182 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:48,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1592611961, now seen corresponding path program 1 times [2019-01-12 22:19:48,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:48,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:48,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:48,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:48,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:48,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:48,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:48,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:48,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 22:19:48,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:19:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:19:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:19:48,519 INFO L87 Difference]: Start difference. First operand 319 states and 772 transitions. Second operand 8 states. [2019-01-12 22:19:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:49,101 INFO L93 Difference]: Finished difference Result 466 states and 1115 transitions. [2019-01-12 22:19:49,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:19:49,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-12 22:19:49,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:49,105 INFO L225 Difference]: With dead ends: 466 [2019-01-12 22:19:49,106 INFO L226 Difference]: Without dead ends: 335 [2019-01-12 22:19:49,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:19:49,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-12 22:19:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 300. [2019-01-12 22:19:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-12 22:19:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 734 transitions. [2019-01-12 22:19:49,124 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 734 transitions. Word has length 29 [2019-01-12 22:19:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:49,125 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 734 transitions. [2019-01-12 22:19:49,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:19:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 734 transitions. [2019-01-12 22:19:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 22:19:49,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:49,132 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 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-12 22:19:49,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2035666861, now seen corresponding path program 1 times [2019-01-12 22:19:49,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:49,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:49,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:49,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:49,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:49,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:49,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:49,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:49,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:49,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:49,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 22:19:49,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:19:49,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:19:49,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:19:49,572 INFO L87 Difference]: Start difference. First operand 300 states and 734 transitions. Second operand 8 states. [2019-01-12 22:19:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:49,790 INFO L93 Difference]: Finished difference Result 482 states and 1147 transitions. [2019-01-12 22:19:49,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:19:49,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-12 22:19:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:49,795 INFO L225 Difference]: With dead ends: 482 [2019-01-12 22:19:49,796 INFO L226 Difference]: Without dead ends: 351 [2019-01-12 22:19:49,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:19:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-01-12 22:19:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-01-12 22:19:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-12 22:19:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 836 transitions. [2019-01-12 22:19:49,809 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 836 transitions. Word has length 29 [2019-01-12 22:19:49,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:49,810 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 836 transitions. [2019-01-12 22:19:49,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:19:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 836 transitions. [2019-01-12 22:19:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 22:19:49,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:49,812 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 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-12 22:19:49,814 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash -460714038, now seen corresponding path program 1 times [2019-01-12 22:19:49,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:49,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:49,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:49,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:49,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:50,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:50,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:50,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:50,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:50,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:50,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-12 22:19:50,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 22:19:50,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 22:19:50,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:19:50,169 INFO L87 Difference]: Start difference. First operand 351 states and 836 transitions. Second operand 9 states. [2019-01-12 22:19:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:50,412 INFO L93 Difference]: Finished difference Result 498 states and 1179 transitions. [2019-01-12 22:19:50,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:19:50,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 22:19:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:50,419 INFO L225 Difference]: With dead ends: 498 [2019-01-12 22:19:50,419 INFO L226 Difference]: Without dead ends: 367 [2019-01-12 22:19:50,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:19:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-01-12 22:19:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 316. [2019-01-12 22:19:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-12 22:19:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 766 transitions. [2019-01-12 22:19:50,430 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 766 transitions. Word has length 33 [2019-01-12 22:19:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:50,431 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 766 transitions. [2019-01-12 22:19:50,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 22:19:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 766 transitions. [2019-01-12 22:19:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 22:19:50,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:50,434 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 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-12 22:19:50,434 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1110322378, now seen corresponding path program 2 times [2019-01-12 22:19:50,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:50,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:50,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:50,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:50,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:50,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:50,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:50,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 22:19:50,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 22:19:50,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:50,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:50,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:50,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-12 22:19:50,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 22:19:50,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 22:19:50,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:19:50,805 INFO L87 Difference]: Start difference. First operand 316 states and 766 transitions. Second operand 9 states. [2019-01-12 22:19:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:50,985 INFO L93 Difference]: Finished difference Result 514 states and 1211 transitions. [2019-01-12 22:19:50,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:19:50,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 22:19:50,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:50,991 INFO L225 Difference]: With dead ends: 514 [2019-01-12 22:19:50,991 INFO L226 Difference]: Without dead ends: 383 [2019-01-12 22:19:50,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:19:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-01-12 22:19:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2019-01-12 22:19:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-01-12 22:19:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 900 transitions. [2019-01-12 22:19:51,003 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 900 transitions. Word has length 33 [2019-01-12 22:19:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:51,003 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 900 transitions. [2019-01-12 22:19:51,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 22:19:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 900 transitions. [2019-01-12 22:19:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 22:19:51,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:51,005 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 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-12 22:19:51,005 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2061178471, now seen corresponding path program 3 times [2019-01-12 22:19:51,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:51,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:51,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:51,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:51,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 22:19:51,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-12 22:19:51,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:51,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:51,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:51,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-12 22:19:51,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:19:51,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:19:51,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:19:51,363 INFO L87 Difference]: Start difference. First operand 383 states and 900 transitions. Second operand 10 states. [2019-01-12 22:19:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:51,599 INFO L93 Difference]: Finished difference Result 530 states and 1243 transitions. [2019-01-12 22:19:51,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:19:51,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-01-12 22:19:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:51,602 INFO L225 Difference]: With dead ends: 530 [2019-01-12 22:19:51,602 INFO L226 Difference]: Without dead ends: 399 [2019-01-12 22:19:51,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:19:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-01-12 22:19:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 332. [2019-01-12 22:19:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-01-12 22:19:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 798 transitions. [2019-01-12 22:19:51,612 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 798 transitions. Word has length 37 [2019-01-12 22:19:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:51,613 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 798 transitions. [2019-01-12 22:19:51,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:19:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 798 transitions. [2019-01-12 22:19:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 22:19:51,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:51,614 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 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-12 22:19:51,614 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:51,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1649592435, now seen corresponding path program 4 times [2019-01-12 22:19:51,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:51,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:51,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:51,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:51,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:51,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:51,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:51,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 22:19:51,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 22:19:51,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:51,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:51,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:51,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-12 22:19:51,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:19:51,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:19:51,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:19:51,964 INFO L87 Difference]: Start difference. First operand 332 states and 798 transitions. Second operand 10 states. [2019-01-12 22:19:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:52,095 INFO L93 Difference]: Finished difference Result 546 states and 1275 transitions. [2019-01-12 22:19:52,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:19:52,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-01-12 22:19:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:52,100 INFO L225 Difference]: With dead ends: 546 [2019-01-12 22:19:52,100 INFO L226 Difference]: Without dead ends: 415 [2019-01-12 22:19:52,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:19:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-01-12 22:19:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2019-01-12 22:19:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-01-12 22:19:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 964 transitions. [2019-01-12 22:19:52,111 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 964 transitions. Word has length 37 [2019-01-12 22:19:52,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:52,111 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 964 transitions. [2019-01-12 22:19:52,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:19:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 964 transitions. [2019-01-12 22:19:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 22:19:52,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:52,113 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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-12 22:19:52,113 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:52,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:52,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2086800042, now seen corresponding path program 5 times [2019-01-12 22:19:52,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:52,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:52,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:52,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:52,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:52,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:52,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:52,296 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 22:19:52,315 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-01-12 22:19:52,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:52,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:52,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:52,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-12 22:19:52,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 22:19:52,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 22:19:52,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:19:52,419 INFO L87 Difference]: Start difference. First operand 415 states and 964 transitions. Second operand 11 states. [2019-01-12 22:19:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:52,697 INFO L93 Difference]: Finished difference Result 562 states and 1307 transitions. [2019-01-12 22:19:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:19:52,699 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-01-12 22:19:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:52,701 INFO L225 Difference]: With dead ends: 562 [2019-01-12 22:19:52,701 INFO L226 Difference]: Without dead ends: 431 [2019-01-12 22:19:52,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:19:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-01-12 22:19:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 348. [2019-01-12 22:19:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-12 22:19:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 830 transitions. [2019-01-12 22:19:52,710 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 830 transitions. Word has length 41 [2019-01-12 22:19:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:52,711 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 830 transitions. [2019-01-12 22:19:52,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 22:19:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 830 transitions. [2019-01-12 22:19:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 22:19:52,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:52,712 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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-12 22:19:52,712 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:52,712 INFO L82 PathProgramCache]: Analyzing trace with hash 449750186, now seen corresponding path program 6 times [2019-01-12 22:19:52,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:52,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:52,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:52,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:52,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:52,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:52,866 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 22:19:52,926 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-01-12 22:19:52,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:52,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:52,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:52,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-12 22:19:52,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 22:19:52,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 22:19:52,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:19:52,990 INFO L87 Difference]: Start difference. First operand 348 states and 830 transitions. Second operand 11 states. [2019-01-12 22:19:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:53,194 INFO L93 Difference]: Finished difference Result 578 states and 1339 transitions. [2019-01-12 22:19:53,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:19:53,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-01-12 22:19:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:53,198 INFO L225 Difference]: With dead ends: 578 [2019-01-12 22:19:53,199 INFO L226 Difference]: Without dead ends: 447 [2019-01-12 22:19:53,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:19:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-01-12 22:19:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2019-01-12 22:19:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-01-12 22:19:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1028 transitions. [2019-01-12 22:19:53,209 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1028 transitions. Word has length 41 [2019-01-12 22:19:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:53,209 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 1028 transitions. [2019-01-12 22:19:53,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 22:19:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1028 transitions. [2019-01-12 22:19:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 22:19:53,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:53,211 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 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-12 22:19:53,211 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash 511353159, now seen corresponding path program 7 times [2019-01-12 22:19:53,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:53,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:53,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:53,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:53,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:53,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:53,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:53,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:53,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-12 22:19:53,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 22:19:53,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 22:19:53,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:19:53,636 INFO L87 Difference]: Start difference. First operand 447 states and 1028 transitions. Second operand 12 states. [2019-01-12 22:19:54,049 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 22:19:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:54,167 INFO L93 Difference]: Finished difference Result 594 states and 1371 transitions. [2019-01-12 22:19:54,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:19:54,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-12 22:19:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:54,173 INFO L225 Difference]: With dead ends: 594 [2019-01-12 22:19:54,173 INFO L226 Difference]: Without dead ends: 463 [2019-01-12 22:19:54,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:19:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-01-12 22:19:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 364. [2019-01-12 22:19:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-01-12 22:19:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 862 transitions. [2019-01-12 22:19:54,182 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 862 transitions. Word has length 45 [2019-01-12 22:19:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:54,183 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 862 transitions. [2019-01-12 22:19:54,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 22:19:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 862 transitions. [2019-01-12 22:19:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 22:19:54,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:54,184 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 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-12 22:19:54,184 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:54,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1081163923, now seen corresponding path program 8 times [2019-01-12 22:19:54,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:54,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:54,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:54,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:54,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:54,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:54,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 22:19:54,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 22:19:54,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:54,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:54,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:54,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-12 22:19:54,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 22:19:54,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 22:19:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:19:54,876 INFO L87 Difference]: Start difference. First operand 364 states and 862 transitions. Second operand 12 states. [2019-01-12 22:19:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:55,079 INFO L93 Difference]: Finished difference Result 610 states and 1403 transitions. [2019-01-12 22:19:55,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:19:55,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-12 22:19:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:55,086 INFO L225 Difference]: With dead ends: 610 [2019-01-12 22:19:55,086 INFO L226 Difference]: Without dead ends: 479 [2019-01-12 22:19:55,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:19:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-01-12 22:19:55,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-01-12 22:19:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-01-12 22:19:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1092 transitions. [2019-01-12 22:19:55,100 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1092 transitions. Word has length 45 [2019-01-12 22:19:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:55,100 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1092 transitions. [2019-01-12 22:19:55,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 22:19:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1092 transitions. [2019-01-12 22:19:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:19:55,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:55,103 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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-12 22:19:55,103 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:55,105 INFO L82 PathProgramCache]: Analyzing trace with hash -578738806, now seen corresponding path program 9 times [2019-01-12 22:19:55,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:55,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:55,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:55,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:55,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:55,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:55,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:55,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 22:19:55,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 22:19:55,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:55,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:55,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:55,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-12 22:19:55,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 22:19:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 22:19:55,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:19:55,424 INFO L87 Difference]: Start difference. First operand 479 states and 1092 transitions. Second operand 13 states. [2019-01-12 22:19:55,773 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 22:19:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:55,847 INFO L93 Difference]: Finished difference Result 626 states and 1435 transitions. [2019-01-12 22:19:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:19:55,848 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-01-12 22:19:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:55,851 INFO L225 Difference]: With dead ends: 626 [2019-01-12 22:19:55,851 INFO L226 Difference]: Without dead ends: 495 [2019-01-12 22:19:55,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-01-12 22:19:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-01-12 22:19:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 380. [2019-01-12 22:19:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-12 22:19:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 894 transitions. [2019-01-12 22:19:55,860 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 894 transitions. Word has length 49 [2019-01-12 22:19:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:55,860 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 894 transitions. [2019-01-12 22:19:55,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 22:19:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 894 transitions. [2019-01-12 22:19:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:19:55,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:55,862 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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-12 22:19:55,862 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash -555139958, now seen corresponding path program 10 times [2019-01-12 22:19:55,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:55,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:55,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:56,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:56,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:56,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 22:19:56,099 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 22:19:56,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:56,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:56,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:56,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-12 22:19:56,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 22:19:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 22:19:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:19:56,263 INFO L87 Difference]: Start difference. First operand 380 states and 894 transitions. Second operand 13 states. [2019-01-12 22:19:56,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:56,485 INFO L93 Difference]: Finished difference Result 642 states and 1467 transitions. [2019-01-12 22:19:56,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:19:56,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-01-12 22:19:56,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:56,490 INFO L225 Difference]: With dead ends: 642 [2019-01-12 22:19:56,490 INFO L226 Difference]: Without dead ends: 511 [2019-01-12 22:19:56,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-01-12 22:19:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-01-12 22:19:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2019-01-12 22:19:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-01-12 22:19:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1156 transitions. [2019-01-12 22:19:56,500 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1156 transitions. Word has length 49 [2019-01-12 22:19:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:56,500 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 1156 transitions. [2019-01-12 22:19:56,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 22:19:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1156 transitions. [2019-01-12 22:19:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 22:19:56,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:56,502 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 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-12 22:19:56,502 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1389448231, now seen corresponding path program 11 times [2019-01-12 22:19:56,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:56,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:56,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:56,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:56,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:56,690 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 22:19:56,776 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-01-12 22:19:56,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:56,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:56,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:56,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-01-12 22:19:56,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 22:19:56,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 22:19:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:19:56,956 INFO L87 Difference]: Start difference. First operand 511 states and 1156 transitions. Second operand 14 states. [2019-01-12 22:19:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:57,201 INFO L93 Difference]: Finished difference Result 658 states and 1499 transitions. [2019-01-12 22:19:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:19:57,202 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-01-12 22:19:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:57,205 INFO L225 Difference]: With dead ends: 658 [2019-01-12 22:19:57,205 INFO L226 Difference]: Without dead ends: 527 [2019-01-12 22:19:57,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:19:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-01-12 22:19:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 396. [2019-01-12 22:19:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-01-12 22:19:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 926 transitions. [2019-01-12 22:19:57,214 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 926 transitions. Word has length 53 [2019-01-12 22:19:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:57,216 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 926 transitions. [2019-01-12 22:19:57,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 22:19:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 926 transitions. [2019-01-12 22:19:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 22:19:57,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:57,218 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 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-12 22:19:57,218 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1121609549, now seen corresponding path program 12 times [2019-01-12 22:19:57,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:57,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:57,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:57,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:57,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:57,486 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 22:19:57,509 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-01-12 22:19:57,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:57,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:57,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:57,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-01-12 22:19:57,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 22:19:57,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 22:19:57,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:19:57,559 INFO L87 Difference]: Start difference. First operand 396 states and 926 transitions. Second operand 14 states. [2019-01-12 22:19:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:57,793 INFO L93 Difference]: Finished difference Result 674 states and 1531 transitions. [2019-01-12 22:19:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:19:57,796 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-01-12 22:19:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:57,801 INFO L225 Difference]: With dead ends: 674 [2019-01-12 22:19:57,801 INFO L226 Difference]: Without dead ends: 543 [2019-01-12 22:19:57,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:19:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-12 22:19:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2019-01-12 22:19:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-01-12 22:19:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1220 transitions. [2019-01-12 22:19:57,813 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1220 transitions. Word has length 53 [2019-01-12 22:19:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:57,814 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 1220 transitions. [2019-01-12 22:19:57,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 22:19:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1220 transitions. [2019-01-12 22:19:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 22:19:57,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:57,817 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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-12 22:19:57,817 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:57,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:57,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1590124650, now seen corresponding path program 13 times [2019-01-12 22:19:57,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:57,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:57,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:57,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:57,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:58,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:58,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:58,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:58,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:58,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:58,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-01-12 22:19:58,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 22:19:58,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 22:19:58,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:19:58,733 INFO L87 Difference]: Start difference. First operand 543 states and 1220 transitions. Second operand 15 states. [2019-01-12 22:19:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:59,061 INFO L93 Difference]: Finished difference Result 690 states and 1563 transitions. [2019-01-12 22:19:59,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 22:19:59,062 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-01-12 22:19:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:59,066 INFO L225 Difference]: With dead ends: 690 [2019-01-12 22:19:59,066 INFO L226 Difference]: Without dead ends: 559 [2019-01-12 22:19:59,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=447, Unknown=0, NotChecked=0, Total=650 [2019-01-12 22:19:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-01-12 22:19:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 412. [2019-01-12 22:19:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-01-12 22:19:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 958 transitions. [2019-01-12 22:19:59,077 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 958 transitions. Word has length 57 [2019-01-12 22:19:59,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:59,079 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 958 transitions. [2019-01-12 22:19:59,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 22:19:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 958 transitions. [2019-01-12 22:19:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 22:19:59,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:59,081 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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-12 22:19:59,081 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:59,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:59,082 INFO L82 PathProgramCache]: Analyzing trace with hash 39711850, now seen corresponding path program 14 times [2019-01-12 22:19:59,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:59,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:59,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:59,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:59,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:59,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:19:59,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:19:59,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 22:19:59,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 22:19:59,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:19:59,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:19:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:59,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:19:59,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-01-12 22:19:59,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 22:19:59,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 22:19:59,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:19:59,379 INFO L87 Difference]: Start difference. First operand 412 states and 958 transitions. Second operand 15 states. [2019-01-12 22:19:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:59,726 INFO L93 Difference]: Finished difference Result 706 states and 1595 transitions. [2019-01-12 22:19:59,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 22:19:59,727 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-01-12 22:19:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:59,731 INFO L225 Difference]: With dead ends: 706 [2019-01-12 22:19:59,731 INFO L226 Difference]: Without dead ends: 575 [2019-01-12 22:19:59,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2019-01-12 22:19:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-01-12 22:19:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-01-12 22:19:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-01-12 22:19:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1284 transitions. [2019-01-12 22:19:59,743 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1284 transitions. Word has length 57 [2019-01-12 22:19:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:59,743 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 1284 transitions. [2019-01-12 22:19:59,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 22:19:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1284 transitions. [2019-01-12 22:19:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 22:19:59,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:59,747 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 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-12 22:19:59,749 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:59,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash -21031161, now seen corresponding path program 15 times [2019-01-12 22:19:59,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:59,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:59,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:59,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:59,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:00,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:00,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:00,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 22:20:00,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 22:20:00,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:00,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:00,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:00,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-01-12 22:20:00,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:20:00,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:20:00,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:20:00,245 INFO L87 Difference]: Start difference. First operand 575 states and 1284 transitions. Second operand 16 states. [2019-01-12 22:20:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:00,550 INFO L93 Difference]: Finished difference Result 722 states and 1627 transitions. [2019-01-12 22:20:00,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 22:20:00,551 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2019-01-12 22:20:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:00,555 INFO L225 Difference]: With dead ends: 722 [2019-01-12 22:20:00,555 INFO L226 Difference]: Without dead ends: 591 [2019-01-12 22:20:00,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2019-01-12 22:20:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-12 22:20:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 428. [2019-01-12 22:20:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-01-12 22:20:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 990 transitions. [2019-01-12 22:20:00,563 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 990 transitions. Word has length 61 [2019-01-12 22:20:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:00,563 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 990 transitions. [2019-01-12 22:20:00,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:20:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 990 transitions. [2019-01-12 22:20:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 22:20:00,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:00,565 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 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-12 22:20:00,565 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1418711251, now seen corresponding path program 16 times [2019-01-12 22:20:00,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:00,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:00,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:00,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:00,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:00,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 22:20:00,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 22:20:00,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:00,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:00,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:00,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-01-12 22:20:00,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:20:00,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:20:00,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:20:00,897 INFO L87 Difference]: Start difference. First operand 428 states and 990 transitions. Second operand 16 states. [2019-01-12 22:20:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:01,235 INFO L93 Difference]: Finished difference Result 738 states and 1659 transitions. [2019-01-12 22:20:01,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 22:20:01,236 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2019-01-12 22:20:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:01,240 INFO L225 Difference]: With dead ends: 738 [2019-01-12 22:20:01,240 INFO L226 Difference]: Without dead ends: 607 [2019-01-12 22:20:01,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2019-01-12 22:20:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-01-12 22:20:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-01-12 22:20:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-01-12 22:20:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1348 transitions. [2019-01-12 22:20:01,251 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1348 transitions. Word has length 61 [2019-01-12 22:20:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:01,252 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 1348 transitions. [2019-01-12 22:20:01,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:20:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1348 transitions. [2019-01-12 22:20:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 22:20:01,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:01,256 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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-12 22:20:01,256 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1997847370, now seen corresponding path program 17 times [2019-01-12 22:20:01,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:01,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:01,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:01,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:01,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:01,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:01,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:01,558 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 22:20:01,587 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 22:20:01,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:01,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:01,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:01,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-01-12 22:20:01,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 22:20:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 22:20:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:20:01,649 INFO L87 Difference]: Start difference. First operand 607 states and 1348 transitions. Second operand 17 states. [2019-01-12 22:20:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:01,975 INFO L93 Difference]: Finished difference Result 754 states and 1691 transitions. [2019-01-12 22:20:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 22:20:01,976 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2019-01-12 22:20:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:01,980 INFO L225 Difference]: With dead ends: 754 [2019-01-12 22:20:01,980 INFO L226 Difference]: Without dead ends: 623 [2019-01-12 22:20:01,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=599, Unknown=0, NotChecked=0, Total=870 [2019-01-12 22:20:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-01-12 22:20:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 444. [2019-01-12 22:20:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-01-12 22:20:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1022 transitions. [2019-01-12 22:20:01,991 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1022 transitions. Word has length 65 [2019-01-12 22:20:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:01,991 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 1022 transitions. [2019-01-12 22:20:01,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 22:20:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1022 transitions. [2019-01-12 22:20:01,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 22:20:01,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:01,995 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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-12 22:20:01,995 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash 420269130, now seen corresponding path program 18 times [2019-01-12 22:20:01,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:01,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:02,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:02,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:02,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:02,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:02,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:02,238 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 22:20:02,262 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-01-12 22:20:02,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:02,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:02,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:02,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-01-12 22:20:02,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 22:20:02,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 22:20:02,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:20:02,340 INFO L87 Difference]: Start difference. First operand 444 states and 1022 transitions. Second operand 17 states. [2019-01-12 22:20:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:02,690 INFO L93 Difference]: Finished difference Result 770 states and 1723 transitions. [2019-01-12 22:20:02,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 22:20:02,692 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2019-01-12 22:20:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:02,695 INFO L225 Difference]: With dead ends: 770 [2019-01-12 22:20:02,696 INFO L226 Difference]: Without dead ends: 639 [2019-01-12 22:20:02,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=608, Unknown=0, NotChecked=0, Total=870 [2019-01-12 22:20:02,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-01-12 22:20:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-01-12 22:20:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-01-12 22:20:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1412 transitions. [2019-01-12 22:20:02,706 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1412 transitions. Word has length 65 [2019-01-12 22:20:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:02,706 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 1412 transitions. [2019-01-12 22:20:02,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 22:20:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1412 transitions. [2019-01-12 22:20:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 22:20:02,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:02,708 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 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-12 22:20:02,708 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash 690225639, now seen corresponding path program 19 times [2019-01-12 22:20:02,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:02,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:02,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:02,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:02,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:03,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:03,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:03,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:03,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:03,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:03,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-01-12 22:20:03,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:20:03,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:20:03,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:20:03,166 INFO L87 Difference]: Start difference. First operand 639 states and 1412 transitions. Second operand 18 states. [2019-01-12 22:20:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:03,557 INFO L93 Difference]: Finished difference Result 786 states and 1755 transitions. [2019-01-12 22:20:03,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 22:20:03,558 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-01-12 22:20:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:03,563 INFO L225 Difference]: With dead ends: 786 [2019-01-12 22:20:03,563 INFO L226 Difference]: Without dead ends: 655 [2019-01-12 22:20:03,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2019-01-12 22:20:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-01-12 22:20:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 460. [2019-01-12 22:20:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-01-12 22:20:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1054 transitions. [2019-01-12 22:20:03,574 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1054 transitions. Word has length 69 [2019-01-12 22:20:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:03,574 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 1054 transitions. [2019-01-12 22:20:03,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:20:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1054 transitions. [2019-01-12 22:20:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 22:20:03,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:03,576 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 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-12 22:20:03,576 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:03,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:03,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1657792755, now seen corresponding path program 20 times [2019-01-12 22:20:03,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:03,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:03,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:03,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:03,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:03,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:03,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:03,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 22:20:03,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 22:20:03,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:03,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:03,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:03,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-01-12 22:20:03,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:20:03,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:20:03,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:20:03,998 INFO L87 Difference]: Start difference. First operand 460 states and 1054 transitions. Second operand 18 states. [2019-01-12 22:20:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:04,324 INFO L93 Difference]: Finished difference Result 802 states and 1787 transitions. [2019-01-12 22:20:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 22:20:04,325 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-01-12 22:20:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:04,329 INFO L225 Difference]: With dead ends: 802 [2019-01-12 22:20:04,329 INFO L226 Difference]: Without dead ends: 671 [2019-01-12 22:20:04,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=284, Invalid=708, Unknown=0, NotChecked=0, Total=992 [2019-01-12 22:20:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-01-12 22:20:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-01-12 22:20:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-01-12 22:20:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1476 transitions. [2019-01-12 22:20:04,341 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1476 transitions. Word has length 69 [2019-01-12 22:20:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:04,341 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 1476 transitions. [2019-01-12 22:20:04,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:20:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1476 transitions. [2019-01-12 22:20:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 22:20:04,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:04,345 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 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-12 22:20:04,345 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1119275478, now seen corresponding path program 21 times [2019-01-12 22:20:04,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:04,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:04,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:04,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:04,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:04,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 22:20:04,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-12 22:20:04,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:04,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:04,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:04,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-01-12 22:20:04,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 22:20:04,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 22:20:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-01-12 22:20:04,681 INFO L87 Difference]: Start difference. First operand 671 states and 1476 transitions. Second operand 19 states. [2019-01-12 22:20:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:05,232 INFO L93 Difference]: Finished difference Result 818 states and 1819 transitions. [2019-01-12 22:20:05,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 22:20:05,233 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2019-01-12 22:20:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:05,237 INFO L225 Difference]: With dead ends: 818 [2019-01-12 22:20:05,238 INFO L226 Difference]: Without dead ends: 687 [2019-01-12 22:20:05,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 22:20:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-01-12 22:20:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 476. [2019-01-12 22:20:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-01-12 22:20:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1086 transitions. [2019-01-12 22:20:05,250 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1086 transitions. Word has length 73 [2019-01-12 22:20:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:05,251 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 1086 transitions. [2019-01-12 22:20:05,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 22:20:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1086 transitions. [2019-01-12 22:20:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 22:20:05,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:05,254 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 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-12 22:20:05,254 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:05,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:05,255 INFO L82 PathProgramCache]: Analyzing trace with hash -690633686, now seen corresponding path program 22 times [2019-01-12 22:20:05,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:05,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:05,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:05,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:05,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:05,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:05,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 22:20:05,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 22:20:05,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:05,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:05,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:05,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-01-12 22:20:05,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 22:20:05,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 22:20:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-01-12 22:20:05,560 INFO L87 Difference]: Start difference. First operand 476 states and 1086 transitions. Second operand 19 states. [2019-01-12 22:20:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:05,958 INFO L93 Difference]: Finished difference Result 834 states and 1851 transitions. [2019-01-12 22:20:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 22:20:05,959 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2019-01-12 22:20:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:05,962 INFO L225 Difference]: With dead ends: 834 [2019-01-12 22:20:05,962 INFO L226 Difference]: Without dead ends: 703 [2019-01-12 22:20:05,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=338, Invalid=784, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 22:20:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-01-12 22:20:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2019-01-12 22:20:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-01-12 22:20:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1540 transitions. [2019-01-12 22:20:05,972 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1540 transitions. Word has length 73 [2019-01-12 22:20:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:05,972 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 1540 transitions. [2019-01-12 22:20:05,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 22:20:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1540 transitions. [2019-01-12 22:20:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 22:20:05,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:05,974 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 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-12 22:20:05,974 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:05,974 INFO L82 PathProgramCache]: Analyzing trace with hash -119534393, now seen corresponding path program 23 times [2019-01-12 22:20:05,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:05,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:05,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:05,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:05,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:06,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:06,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:06,249 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 22:20:06,282 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-12 22:20:06,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:06,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:06,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:06,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-01-12 22:20:06,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 22:20:06,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 22:20:06,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:20:06,360 INFO L87 Difference]: Start difference. First operand 703 states and 1540 transitions. Second operand 20 states. [2019-01-12 22:20:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:06,932 INFO L93 Difference]: Finished difference Result 850 states and 1883 transitions. [2019-01-12 22:20:06,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 22:20:06,934 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2019-01-12 22:20:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:06,938 INFO L225 Difference]: With dead ends: 850 [2019-01-12 22:20:06,938 INFO L226 Difference]: Without dead ends: 719 [2019-01-12 22:20:06,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=379, Invalid=881, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 22:20:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-01-12 22:20:06,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 492. [2019-01-12 22:20:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-01-12 22:20:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1118 transitions. [2019-01-12 22:20:06,947 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1118 transitions. Word has length 77 [2019-01-12 22:20:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:06,947 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 1118 transitions. [2019-01-12 22:20:06,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 22:20:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1118 transitions. [2019-01-12 22:20:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 22:20:06,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:06,949 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 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-12 22:20:06,949 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:06,949 INFO L82 PathProgramCache]: Analyzing trace with hash -604365075, now seen corresponding path program 24 times [2019-01-12 22:20:06,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:06,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:06,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:06,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:06,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:07,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:07,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:07,359 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 22:20:07,490 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-12 22:20:07,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:07,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:07,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:07,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-01-12 22:20:07,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 22:20:07,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 22:20:07,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:20:07,570 INFO L87 Difference]: Start difference. First operand 492 states and 1118 transitions. Second operand 20 states. [2019-01-12 22:20:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:08,087 INFO L93 Difference]: Finished difference Result 866 states and 1915 transitions. [2019-01-12 22:20:08,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 22:20:08,089 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2019-01-12 22:20:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:08,093 INFO L225 Difference]: With dead ends: 866 [2019-01-12 22:20:08,093 INFO L226 Difference]: Without dead ends: 735 [2019-01-12 22:20:08,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=359, Invalid=901, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 22:20:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-01-12 22:20:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2019-01-12 22:20:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-01-12 22:20:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1604 transitions. [2019-01-12 22:20:08,103 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1604 transitions. Word has length 77 [2019-01-12 22:20:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:08,104 INFO L480 AbstractCegarLoop]: Abstraction has 735 states and 1604 transitions. [2019-01-12 22:20:08,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 22:20:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1604 transitions. [2019-01-12 22:20:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 22:20:08,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:08,105 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 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-12 22:20:08,106 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash -398143222, now seen corresponding path program 25 times [2019-01-12 22:20:08,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:08,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:08,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:09,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:09,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:09,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:09,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:09,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:09,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-01-12 22:20:09,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 22:20:09,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 22:20:09,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-01-12 22:20:09,131 INFO L87 Difference]: Start difference. First operand 735 states and 1604 transitions. Second operand 21 states. [2019-01-12 22:20:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:09,560 INFO L93 Difference]: Finished difference Result 882 states and 1947 transitions. [2019-01-12 22:20:09,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 22:20:09,561 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-01-12 22:20:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:09,565 INFO L225 Difference]: With dead ends: 882 [2019-01-12 22:20:09,565 INFO L226 Difference]: Without dead ends: 751 [2019-01-12 22:20:09,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=437, Invalid=969, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 22:20:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-01-12 22:20:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 508. [2019-01-12 22:20:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-01-12 22:20:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1150 transitions. [2019-01-12 22:20:09,576 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1150 transitions. Word has length 81 [2019-01-12 22:20:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:09,577 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 1150 transitions. [2019-01-12 22:20:09,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 22:20:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1150 transitions. [2019-01-12 22:20:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 22:20:09,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:09,578 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 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-12 22:20:09,578 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash 261676042, now seen corresponding path program 26 times [2019-01-12 22:20:09,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:09,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:09,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:09,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:09,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:09,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 22:20:09,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 22:20:09,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:09,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:10,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:10,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-01-12 22:20:10,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 22:20:10,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 22:20:10,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-01-12 22:20:10,051 INFO L87 Difference]: Start difference. First operand 508 states and 1150 transitions. Second operand 21 states. [2019-01-12 22:20:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:10,612 INFO L93 Difference]: Finished difference Result 898 states and 1979 transitions. [2019-01-12 22:20:10,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 22:20:10,614 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-01-12 22:20:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:10,617 INFO L225 Difference]: With dead ends: 898 [2019-01-12 22:20:10,617 INFO L226 Difference]: Without dead ends: 767 [2019-01-12 22:20:10,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=424, Invalid=982, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 22:20:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-01-12 22:20:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2019-01-12 22:20:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-01-12 22:20:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1668 transitions. [2019-01-12 22:20:10,628 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1668 transitions. Word has length 81 [2019-01-12 22:20:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:10,629 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1668 transitions. [2019-01-12 22:20:10,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 22:20:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1668 transitions. [2019-01-12 22:20:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-12 22:20:10,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:10,630 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 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-12 22:20:10,631 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1261226073, now seen corresponding path program 27 times [2019-01-12 22:20:10,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:10,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:10,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:10,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:10,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:10,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:10,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:10,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 22:20:10,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-12 22:20:10,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:10,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:11,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:11,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-01-12 22:20:11,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 22:20:11,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 22:20:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-01-12 22:20:11,063 INFO L87 Difference]: Start difference. First operand 767 states and 1668 transitions. Second operand 22 states. [2019-01-12 22:20:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:11,566 INFO L93 Difference]: Finished difference Result 914 states and 2011 transitions. [2019-01-12 22:20:11,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 22:20:11,567 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2019-01-12 22:20:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:11,572 INFO L225 Difference]: With dead ends: 914 [2019-01-12 22:20:11,572 INFO L226 Difference]: Without dead ends: 783 [2019-01-12 22:20:11,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=470, Invalid=1090, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 22:20:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-01-12 22:20:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 524. [2019-01-12 22:20:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-01-12 22:20:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1182 transitions. [2019-01-12 22:20:11,582 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1182 transitions. Word has length 85 [2019-01-12 22:20:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:11,582 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1182 transitions. [2019-01-12 22:20:11,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 22:20:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1182 transitions. [2019-01-12 22:20:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-12 22:20:11,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:11,583 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 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-12 22:20:11,584 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:11,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:11,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1269712589, now seen corresponding path program 28 times [2019-01-12 22:20:11,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:11,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:11,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:11,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:11,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:11,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:11,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:11,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 22:20:11,944 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 22:20:11,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:11,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:12,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:12,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-01-12 22:20:12,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 22:20:12,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 22:20:12,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-01-12 22:20:12,004 INFO L87 Difference]: Start difference. First operand 524 states and 1182 transitions. Second operand 22 states. [2019-01-12 22:20:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:12,458 INFO L93 Difference]: Finished difference Result 930 states and 2043 transitions. [2019-01-12 22:20:12,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 22:20:12,459 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2019-01-12 22:20:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:12,463 INFO L225 Difference]: With dead ends: 930 [2019-01-12 22:20:12,464 INFO L226 Difference]: Without dead ends: 799 [2019-01-12 22:20:12,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=450, Invalid=1032, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 22:20:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-01-12 22:20:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2019-01-12 22:20:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-01-12 22:20:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1732 transitions. [2019-01-12 22:20:12,479 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1732 transitions. Word has length 85 [2019-01-12 22:20:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:12,479 INFO L480 AbstractCegarLoop]: Abstraction has 799 states and 1732 transitions. [2019-01-12 22:20:12,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 22:20:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1732 transitions. [2019-01-12 22:20:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-12 22:20:12,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:12,484 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 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-12 22:20:12,484 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash -823686166, now seen corresponding path program 29 times [2019-01-12 22:20:12,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:12,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:12,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:12,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:12,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:12,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:12,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:12,945 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 22:20:12,981 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-01-12 22:20:12,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:12,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:13,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:13,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-01-12 22:20:13,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 22:20:13,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 22:20:13,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-01-12 22:20:13,034 INFO L87 Difference]: Start difference. First operand 799 states and 1732 transitions. Second operand 23 states. [2019-01-12 22:20:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:14,006 INFO L93 Difference]: Finished difference Result 946 states and 2075 transitions. [2019-01-12 22:20:14,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 22:20:14,007 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2019-01-12 22:20:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:14,012 INFO L225 Difference]: With dead ends: 946 [2019-01-12 22:20:14,012 INFO L226 Difference]: Without dead ends: 815 [2019-01-12 22:20:14,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=535, Invalid=1187, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 22:20:14,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-01-12 22:20:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 540. [2019-01-12 22:20:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-01-12 22:20:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1214 transitions. [2019-01-12 22:20:14,025 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1214 transitions. Word has length 89 [2019-01-12 22:20:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:14,026 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 1214 transitions. [2019-01-12 22:20:14,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 22:20:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1214 transitions. [2019-01-12 22:20:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-12 22:20:14,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:14,029 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 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-12 22:20:14,029 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:14,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:14,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1221192726, now seen corresponding path program 30 times [2019-01-12 22:20:14,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:14,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:14,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:14,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:14,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:14,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:14,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:14,316 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 22:20:14,349 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-12 22:20:14,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:14,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:14,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:14,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-01-12 22:20:14,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 22:20:14,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 22:20:14,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-01-12 22:20:14,409 INFO L87 Difference]: Start difference. First operand 540 states and 1214 transitions. Second operand 23 states. [2019-01-12 22:20:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:14,930 INFO L93 Difference]: Finished difference Result 962 states and 2107 transitions. [2019-01-12 22:20:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 22:20:14,931 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2019-01-12 22:20:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:14,933 INFO L225 Difference]: With dead ends: 962 [2019-01-12 22:20:14,934 INFO L226 Difference]: Without dead ends: 831 [2019-01-12 22:20:14,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=520, Invalid=1202, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 22:20:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-01-12 22:20:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2019-01-12 22:20:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-01-12 22:20:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1796 transitions. [2019-01-12 22:20:14,951 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1796 transitions. Word has length 89 [2019-01-12 22:20:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:14,951 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1796 transitions. [2019-01-12 22:20:14,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 22:20:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1796 transitions. [2019-01-12 22:20:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 22:20:14,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:14,954 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 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-12 22:20:14,954 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1008893305, now seen corresponding path program 31 times [2019-01-12 22:20:14,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:14,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:14,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:14,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:14,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:15,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:15,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:15,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:15,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:15,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:15,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-01-12 22:20:15,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 22:20:15,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 22:20:15,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:20:15,752 INFO L87 Difference]: Start difference. First operand 831 states and 1796 transitions. Second operand 24 states. [2019-01-12 22:20:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:16,269 INFO L93 Difference]: Finished difference Result 978 states and 2139 transitions. [2019-01-12 22:20:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 22:20:16,277 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2019-01-12 22:20:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:16,279 INFO L225 Difference]: With dead ends: 978 [2019-01-12 22:20:16,281 INFO L226 Difference]: Without dead ends: 847 [2019-01-12 22:20:16,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=571, Invalid=1321, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 22:20:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-01-12 22:20:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 556. [2019-01-12 22:20:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-01-12 22:20:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1246 transitions. [2019-01-12 22:20:16,295 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1246 transitions. Word has length 93 [2019-01-12 22:20:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:16,295 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 1246 transitions. [2019-01-12 22:20:16,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 22:20:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1246 transitions. [2019-01-12 22:20:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 22:20:16,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:16,299 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 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-12 22:20:16,299 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash -265515347, now seen corresponding path program 32 times [2019-01-12 22:20:16,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:16,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:16,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:20:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:16,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:16,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:16,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 22:20:16,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 22:20:16,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:16,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:16,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:16,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-01-12 22:20:16,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 22:20:16,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 22:20:16,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:20:16,697 INFO L87 Difference]: Start difference. First operand 556 states and 1246 transitions. Second operand 24 states. [2019-01-12 22:20:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:17,233 INFO L93 Difference]: Finished difference Result 994 states and 2171 transitions. [2019-01-12 22:20:17,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 22:20:17,234 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2019-01-12 22:20:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:17,237 INFO L225 Difference]: With dead ends: 994 [2019-01-12 22:20:17,238 INFO L226 Difference]: Without dead ends: 863 [2019-01-12 22:20:17,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=536, Invalid=1356, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 22:20:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-01-12 22:20:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-01-12 22:20:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-01-12 22:20:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1860 transitions. [2019-01-12 22:20:17,251 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1860 transitions. Word has length 93 [2019-01-12 22:20:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:17,252 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1860 transitions. [2019-01-12 22:20:17,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 22:20:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1860 transitions. [2019-01-12 22:20:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 22:20:17,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:17,256 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 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-12 22:20:17,256 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:17,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1745970890, now seen corresponding path program 33 times [2019-01-12 22:20:17,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:17,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:17,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:17,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:20:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:18,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 22:20:18,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 22:20:18,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 22:20:18,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 22:20:18,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 22:20:18,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 22:20:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:20:18,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 22:20:18,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-01-12 22:20:18,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 22:20:18,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 22:20:18,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2019-01-12 22:20:18,558 INFO L87 Difference]: Start difference. First operand 863 states and 1860 transitions. Second operand 25 states. [2019-01-12 22:20:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:20:19,092 INFO L93 Difference]: Finished difference Result 1010 states and 2203 transitions. [2019-01-12 22:20:19,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 22:20:19,093 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2019-01-12 22:20:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:20:19,096 INFO L225 Difference]: With dead ends: 1010 [2019-01-12 22:20:19,096 INFO L226 Difference]: Without dead ends: 879 [2019-01-12 22:20:19,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=579, Invalid=1491, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 22:20:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-01-12 22:20:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 572. [2019-01-12 22:20:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-01-12 22:20:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1278 transitions. [2019-01-12 22:20:19,107 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1278 transitions. Word has length 97 [2019-01-12 22:20:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:20:19,107 INFO L480 AbstractCegarLoop]: Abstraction has 572 states and 1278 transitions. [2019-01-12 22:20:19,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 22:20:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1278 transitions. [2019-01-12 22:20:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 22:20:19,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:20:19,108 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 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-12 22:20:19,109 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:20:19,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:20:19,109 INFO L82 PathProgramCache]: Analyzing trace with hash -510825526, now seen corresponding path program 34 times [2019-01-12 22:20:19,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:20:19,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:20:19,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:19,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:20:19,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:20:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:20:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:20:19,186 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 22:20:19,294 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 22:20:19,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:20:19 BasicIcfg [2019-01-12 22:20:19,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 22:20:19,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 22:20:19,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 22:20:19,298 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 22:20:19,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:19:45" (3/4) ... [2019-01-12 22:20:19,305 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 22:20:19,469 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 22:20:19,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 22:20:19,473 INFO L168 Benchmark]: Toolchain (without parser) took 35236.60 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 436.2 MB). Free memory was 947.3 MB in the beginning and 808.1 MB in the end (delta: 139.2 MB). Peak memory consumption was 575.4 MB. Max. memory is 11.5 GB. [2019-01-12 22:20:19,474 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:20:19,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-01-12 22:20:19,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.03 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-12 22:20:19,481 INFO L168 Benchmark]: Boogie Preprocessor took 56.17 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-12 22:20:19,481 INFO L168 Benchmark]: RCFGBuilder took 608.61 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-01-12 22:20:19,490 INFO L168 Benchmark]: TraceAbstraction took 33633.18 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.0 MB). Free memory was 1.1 GB in the beginning and 831.9 MB in the end (delta: 230.9 MB). Peak memory consumption was 544.9 MB. Max. memory is 11.5 GB. [2019-01-12 22:20:19,490 INFO L168 Benchmark]: Witness Printer took 174.34 ms. Allocated memory is still 1.5 GB. Free memory was 831.9 MB in the beginning and 808.1 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-01-12 22:20:19,497 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.44 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 700.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.03 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. * Boogie Preprocessor took 56.17 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 608.61 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33633.18 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.0 MB). Free memory was 1.1 GB in the beginning and 831.9 MB in the end (delta: 230.9 MB). Peak memory consumption was 544.9 MB. Max. memory is 11.5 GB. * Witness Printer took 174.34 ms. Allocated memory is still 1.5 GB. Free memory was 831.9 MB in the beginning and 808.1 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 688]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L660] -1 int i = 3, j = 6; VAL [i=3, j=6] [L678] -1 pthread_t id1, id2; VAL [i=3, j=6] [L679] FCALL, FORK -1 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L662] 0 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L680] FCALL, FORK -1 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L670] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L662] COND TRUE 0 k < 10 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L670] COND TRUE 1 k < 10 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=0] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L662] COND TRUE 0 k < 10 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L670] COND TRUE 1 k < 10 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=1] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L662] COND TRUE 0 k < 10 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L670] COND TRUE 1 k < 10 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=2] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L662] COND TRUE 0 k < 10 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L670] COND TRUE 1 k < 10 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=3] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L662] COND TRUE 0 k < 10 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L670] COND TRUE 1 k < 10 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L662] COND TRUE 0 k < 10 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L670] COND TRUE 1 k < 10 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=5] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=5] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L662] COND TRUE 0 k < 10 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L670] COND TRUE 1 k < 10 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=6] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=6] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L662] COND TRUE 0 k < 10 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L670] COND TRUE 1 k < 10 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=7] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=7] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L662] COND TRUE 0 k < 10 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L670] COND TRUE 1 k < 10 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=8] [L670] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=8] [L662] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L662] COND TRUE 0 k < 10 [L664] 0 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L670] COND TRUE 1 k < 10 [L672] 1 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L682] -1 int condI = i >= (2*10 +6); [L685] -1 int condJ = j >= (2*10 +6); VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L687] COND TRUE -1 condI || condJ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L688] -1 __VERIFIER_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 64 locations, 1 error locations. UNSAFE Result, 33.5s OverallTime, 40 OverallIterations, 10 TraceHistogramMax, 14.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2153 SDtfs, 10517 SDslu, 14630 SDs, 0 SdLazy, 2804 SolverSat, 1538 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3123 GetRequests, 2179 SyntacticMatches, 0 SemanticMatches, 944 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 21.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1012occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 3088 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 4530 NumberOfCodeBlocks, 4530 NumberOfCodeBlocksAsserted, 171 NumberOfCheckSat, 4359 ConstructedInterpolants, 0 QuantifiedInterpolants, 883467 SizeOfPredicates, 499 NumberOfNonLiveVariables, 5392 ConjunctsInSsa, 612 ConjunctsInUnsatCore, 74 InterpolantComputations, 4 PerfectInterpolantSequences, 0/7176 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...