./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread/singleton_with-uninit-problems_true-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/singleton_with-uninit-problems_true-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 17cb67016a37b4d6ca4d07f4518c2ed6beef643f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 22:21:32,477 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 22:21:32,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 22:21:32,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 22:21:32,490 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 22:21:32,491 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 22:21:32,492 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 22:21:32,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 22:21:32,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 22:21:32,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 22:21:32,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 22:21:32,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 22:21:32,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 22:21:32,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 22:21:32,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 22:21:32,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 22:21:32,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 22:21:32,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 22:21:32,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 22:21:32,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 22:21:32,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 22:21:32,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 22:21:32,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 22:21:32,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 22:21:32,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 22:21:32,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 22:21:32,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 22:21:32,515 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 22:21:32,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 22:21:32,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 22:21:32,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 22:21:32,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 22:21:32,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 22:21:32,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 22:21:32,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 22:21:32,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 22:21:32,520 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:21:32,535 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 22:21:32,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 22:21:32,536 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 22:21:32,537 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 22:21:32,537 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 22:21:32,537 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 22:21:32,537 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 22:21:32,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 22:21:32,538 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 22:21:32,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 22:21:32,538 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 22:21:32,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 22:21:32,538 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 22:21:32,539 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 22:21:32,539 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 22:21:32,539 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 22:21:32,539 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 22:21:32,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 22:21:32,539 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 22:21:32,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 22:21:32,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 22:21:32,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:21:32,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 22:21:32,540 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 22:21:32,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 22:21:32,541 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 22:21:32,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 22:21:32,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 22:21:32,541 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 -> 17cb67016a37b4d6ca4d07f4518c2ed6beef643f [2019-01-12 22:21:32,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 22:21:32,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 22:21:32,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 22:21:32,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 22:21:32,591 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 22:21:32,592 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2019-01-12 22:21:32,646 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567d4961d/8710501740484590b74644d754d22198/FLAGb736edbcc [2019-01-12 22:21:33,188 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 22:21:33,189 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2019-01-12 22:21:33,209 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567d4961d/8710501740484590b74644d754d22198/FLAGb736edbcc [2019-01-12 22:21:33,434 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567d4961d/8710501740484590b74644d754d22198 [2019-01-12 22:21:33,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 22:21:33,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 22:21:33,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 22:21:33,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 22:21:33,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 22:21:33,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:21:33" (1/1) ... [2019-01-12 22:21:33,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc5ec5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:33, skipping insertion in model container [2019-01-12 22:21:33,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:21:33" (1/1) ... [2019-01-12 22:21:33,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 22:21:33,522 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 22:21:33,997 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:21:34,010 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 22:21:34,172 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:21:34,339 INFO L195 MainTranslator]: Completed translation [2019-01-12 22:21:34,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:34 WrapperNode [2019-01-12 22:21:34,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 22:21:34,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 22:21:34,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 22:21:34,341 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 22:21:34,351 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:21:34" (1/1) ... [2019-01-12 22:21:34,373 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:21:34" (1/1) ... [2019-01-12 22:21:34,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 22:21:34,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 22:21:34,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 22:21:34,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 22:21:34,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:34" (1/1) ... [2019-01-12 22:21:34,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:34" (1/1) ... [2019-01-12 22:21:34,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:34" (1/1) ... [2019-01-12 22:21:34,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:34" (1/1) ... [2019-01-12 22:21:34,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:34" (1/1) ... [2019-01-12 22:21:34,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:34" (1/1) ... [2019-01-12 22:21:34,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:34" (1/1) ... [2019-01-12 22:21:34,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 22:21:34,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 22:21:34,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 22:21:34,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 22:21:34,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:34" (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:21:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 22:21:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 22:21:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 22:21:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-01-12 22:21:34,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-01-12 22:21:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-01-12 22:21:34,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-01-12 22:21:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-01-12 22:21:34,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-01-12 22:21:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-01-12 22:21:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-01-12 22:21:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 22:21:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 22:21:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 22:21:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 22:21:34,516 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:21:35,097 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 22:21:35,097 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-12 22:21:35,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:21:35 BoogieIcfgContainer [2019-01-12 22:21:35,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 22:21:35,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 22:21:35,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 22:21:35,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 22:21:35,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:21:33" (1/3) ... [2019-01-12 22:21:35,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e0b4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:21:35, skipping insertion in model container [2019-01-12 22:21:35,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:21:34" (2/3) ... [2019-01-12 22:21:35,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e0b4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:21:35, skipping insertion in model container [2019-01-12 22:21:35,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:21:35" (3/3) ... [2019-01-12 22:21:35,107 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems_true-unreach-call.i [2019-01-12 22:21:35,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,152 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,152 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,153 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,153 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,154 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,154 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,154 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,154 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,155 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,155 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,155 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,155 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,156 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,156 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,156 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,156 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,157 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,159 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,161 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,161 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,161 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,162 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,162 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,168 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,168 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,168 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,168 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,172 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,173 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,174 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,175 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,176 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,177 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,178 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,179 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,180 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,180 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,182 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,182 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,183 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,183 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,183 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,185 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,185 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,185 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,185 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,185 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,186 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,186 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,186 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,186 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,189 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,189 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,190 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,191 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,191 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,191 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,192 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,192 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,194 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,195 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,196 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,196 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:21:35,806 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 22:21:35,806 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 22:21:35,814 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 22:21:35,829 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 22:21:35,850 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 22:21:35,851 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 22:21:35,851 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 22:21:35,851 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 22:21:35,851 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 22:21:35,851 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 22:21:35,851 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 22:21:35,851 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 22:21:35,852 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 22:21:35,864 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 239 transitions [2019-01-12 22:21:40,556 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 60962 states. [2019-01-12 22:21:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 60962 states. [2019-01-12 22:21:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 22:21:40,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:21:40,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:21:40,575 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:21:40,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:21:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1451762756, now seen corresponding path program 1 times [2019-01-12 22:21:40,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:21:40,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:21:40,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:21:40,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:21:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:21:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:21:40,975 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:21:40,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:21:40,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:21:40,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:21:40,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:21:40,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:21:41,001 INFO L87 Difference]: Start difference. First operand 60962 states. Second operand 5 states. [2019-01-12 22:21:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:21:42,531 INFO L93 Difference]: Finished difference Result 90537 states and 379072 transitions. [2019-01-12 22:21:42,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:21:42,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 22:21:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:21:42,878 INFO L225 Difference]: With dead ends: 90537 [2019-01-12 22:21:42,879 INFO L226 Difference]: Without dead ends: 40487 [2019-01-12 22:21:42,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:21:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40487 states. [2019-01-12 22:21:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40487 to 40487. [2019-01-12 22:21:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40487 states. [2019-01-12 22:21:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40487 states to 40487 states and 173218 transitions. [2019-01-12 22:21:44,920 INFO L78 Accepts]: Start accepts. Automaton has 40487 states and 173218 transitions. Word has length 33 [2019-01-12 22:21:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:21:44,921 INFO L480 AbstractCegarLoop]: Abstraction has 40487 states and 173218 transitions. [2019-01-12 22:21:44,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:21:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 40487 states and 173218 transitions. [2019-01-12 22:21:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 22:21:44,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:21:44,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:21:44,925 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:21:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:21:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1742157727, now seen corresponding path program 1 times [2019-01-12 22:21:44,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:21:44,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:21:44,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:21:44,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:21:44,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:21:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:21:45,383 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:21:45,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:21:45,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:21:45,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:21:45,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:21:45,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:21:45,387 INFO L87 Difference]: Start difference. First operand 40487 states and 173218 transitions. Second operand 10 states. [2019-01-12 22:21:45,996 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-01-12 22:21:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:21:47,223 INFO L93 Difference]: Finished difference Result 47144 states and 204499 transitions. [2019-01-12 22:21:47,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:21:47,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-12 22:21:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:21:47,486 INFO L225 Difference]: With dead ends: 47144 [2019-01-12 22:21:47,486 INFO L226 Difference]: Without dead ends: 47144 [2019-01-12 22:21:47,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:21:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47144 states. [2019-01-12 22:21:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47144 to 40505. [2019-01-12 22:21:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40505 states. [2019-01-12 22:21:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40505 states to 40505 states and 173247 transitions. [2019-01-12 22:21:49,471 INFO L78 Accepts]: Start accepts. Automaton has 40505 states and 173247 transitions. Word has length 35 [2019-01-12 22:21:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:21:49,472 INFO L480 AbstractCegarLoop]: Abstraction has 40505 states and 173247 transitions. [2019-01-12 22:21:49,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:21:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 40505 states and 173247 transitions. [2019-01-12 22:21:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 22:21:49,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:21:49,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:21:49,474 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:21:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:21:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1856245215, now seen corresponding path program 2 times [2019-01-12 22:21:49,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:21:49,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:21:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:21:49,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:21:49,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:21:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:21:49,712 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:21:49,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:21:49,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:21:49,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:21:49,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:21:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:21:49,713 INFO L87 Difference]: Start difference. First operand 40505 states and 173247 transitions. Second operand 10 states. [2019-01-12 22:21:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:21:51,467 INFO L93 Difference]: Finished difference Result 53745 states and 235686 transitions. [2019-01-12 22:21:51,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:21:51,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-12 22:21:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:21:51,764 INFO L225 Difference]: With dead ends: 53745 [2019-01-12 22:21:51,764 INFO L226 Difference]: Without dead ends: 53745 [2019-01-12 22:21:51,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:21:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53745 states. [2019-01-12 22:21:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53745 to 40451. [2019-01-12 22:21:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40451 states. [2019-01-12 22:21:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40451 states to 40451 states and 173155 transitions. [2019-01-12 22:21:52,919 INFO L78 Accepts]: Start accepts. Automaton has 40451 states and 173155 transitions. Word has length 35 [2019-01-12 22:21:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:21:52,919 INFO L480 AbstractCegarLoop]: Abstraction has 40451 states and 173155 transitions. [2019-01-12 22:21:52,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:21:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40451 states and 173155 transitions. [2019-01-12 22:21:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 22:21:52,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:21:52,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:21:52,938 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:21:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:21:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash 864239609, now seen corresponding path program 1 times [2019-01-12 22:21:52,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:21:52,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:21:52,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:21:52,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:21:52,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:21:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:21:53,071 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:21:53,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:21:53,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:21:53,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:21:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:21:53,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:21:53,072 INFO L87 Difference]: Start difference. First operand 40451 states and 173155 transitions. Second operand 5 states. [2019-01-12 22:21:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:21:53,633 INFO L93 Difference]: Finished difference Result 74947 states and 314581 transitions. [2019-01-12 22:21:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:21:53,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-12 22:21:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:21:53,800 INFO L225 Difference]: With dead ends: 74947 [2019-01-12 22:21:53,800 INFO L226 Difference]: Without dead ends: 56513 [2019-01-12 22:21:53,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:21:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56513 states. [2019-01-12 22:21:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56513 to 40763. [2019-01-12 22:21:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40763 states. [2019-01-12 22:21:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40763 states to 40763 states and 169305 transitions. [2019-01-12 22:21:58,363 INFO L78 Accepts]: Start accepts. Automaton has 40763 states and 169305 transitions. Word has length 45 [2019-01-12 22:21:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:21:58,364 INFO L480 AbstractCegarLoop]: Abstraction has 40763 states and 169305 transitions. [2019-01-12 22:21:58,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:21:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 40763 states and 169305 transitions. [2019-01-12 22:21:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 22:21:58,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:21:58,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:21:58,389 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:21:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:21:58,390 INFO L82 PathProgramCache]: Analyzing trace with hash 238055866, now seen corresponding path program 1 times [2019-01-12 22:21:58,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:21:58,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:21:58,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:21:58,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:21:58,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:21:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:21:58,614 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:21:58,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:21:58,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 22:21:58,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 22:21:58,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 22:21:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:21:58,615 INFO L87 Difference]: Start difference. First operand 40763 states and 169305 transitions. Second operand 9 states. [2019-01-12 22:21:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:21:59,447 INFO L93 Difference]: Finished difference Result 58871 states and 239639 transitions. [2019-01-12 22:21:59,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:21:59,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-01-12 22:21:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:21:59,587 INFO L225 Difference]: With dead ends: 58871 [2019-01-12 22:21:59,587 INFO L226 Difference]: Without dead ends: 56463 [2019-01-12 22:21:59,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:21:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56463 states. [2019-01-12 22:22:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56463 to 40658. [2019-01-12 22:22:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40658 states. [2019-01-12 22:22:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40658 states to 40658 states and 168991 transitions. [2019-01-12 22:22:01,114 INFO L78 Accepts]: Start accepts. Automaton has 40658 states and 168991 transitions. Word has length 47 [2019-01-12 22:22:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:01,115 INFO L480 AbstractCegarLoop]: Abstraction has 40658 states and 168991 transitions. [2019-01-12 22:22:01,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 22:22:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 40658 states and 168991 transitions. [2019-01-12 22:22:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 22:22:01,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:01,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:01,140 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:01,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:01,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1318988660, now seen corresponding path program 1 times [2019-01-12 22:22:01,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:01,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:01,269 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:22:01,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:01,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:22:01,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:22:01,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:22:01,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:22:01,271 INFO L87 Difference]: Start difference. First operand 40658 states and 168991 transitions. Second operand 7 states. [2019-01-12 22:22:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:02,011 INFO L93 Difference]: Finished difference Result 71197 states and 287728 transitions. [2019-01-12 22:22:02,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:22:02,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-01-12 22:22:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:02,131 INFO L225 Difference]: With dead ends: 71197 [2019-01-12 22:22:02,131 INFO L226 Difference]: Without dead ends: 48359 [2019-01-12 22:22:02,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:22:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48359 states. [2019-01-12 22:22:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48359 to 42374. [2019-01-12 22:22:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42374 states. [2019-01-12 22:22:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42374 states to 42374 states and 171196 transitions. [2019-01-12 22:22:02,975 INFO L78 Accepts]: Start accepts. Automaton has 42374 states and 171196 transitions. Word has length 48 [2019-01-12 22:22:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:02,977 INFO L480 AbstractCegarLoop]: Abstraction has 42374 states and 171196 transitions. [2019-01-12 22:22:02,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:22:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 42374 states and 171196 transitions. [2019-01-12 22:22:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 22:22:03,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:03,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:03,009 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:03,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:03,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1778320058, now seen corresponding path program 1 times [2019-01-12 22:22:03,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:03,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:03,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:03,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:03,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:03,244 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:22:03,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:03,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 22:22:03,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 22:22:03,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 22:22:03,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:22:03,245 INFO L87 Difference]: Start difference. First operand 42374 states and 171196 transitions. Second operand 11 states. [2019-01-12 22:22:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:03,935 INFO L93 Difference]: Finished difference Result 54161 states and 215849 transitions. [2019-01-12 22:22:03,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:22:03,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-01-12 22:22:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:04,060 INFO L225 Difference]: With dead ends: 54161 [2019-01-12 22:22:04,060 INFO L226 Difference]: Without dead ends: 50905 [2019-01-12 22:22:04,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:22:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50905 states. [2019-01-12 22:22:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50905 to 42044. [2019-01-12 22:22:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42044 states. [2019-01-12 22:22:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42044 states to 42044 states and 169930 transitions. [2019-01-12 22:22:05,603 INFO L78 Accepts]: Start accepts. Automaton has 42044 states and 169930 transitions. Word has length 50 [2019-01-12 22:22:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:05,603 INFO L480 AbstractCegarLoop]: Abstraction has 42044 states and 169930 transitions. [2019-01-12 22:22:05,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 22:22:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 42044 states and 169930 transitions. [2019-01-12 22:22:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 22:22:05,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:05,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:05,637 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1136732819, now seen corresponding path program 1 times [2019-01-12 22:22:05,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:05,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:05,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:05,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:05,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:06,436 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:22:06,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:06,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-12 22:22:06,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 22:22:06,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 22:22:06,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:22:06,437 INFO L87 Difference]: Start difference. First operand 42044 states and 169930 transitions. Second operand 17 states. [2019-01-12 22:22:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:07,743 INFO L93 Difference]: Finished difference Result 48298 states and 194881 transitions. [2019-01-12 22:22:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:22:07,744 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2019-01-12 22:22:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:07,862 INFO L225 Difference]: With dead ends: 48298 [2019-01-12 22:22:07,863 INFO L226 Difference]: Without dead ends: 47842 [2019-01-12 22:22:07,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-01-12 22:22:08,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47842 states. [2019-01-12 22:22:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47842 to 45605. [2019-01-12 22:22:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45605 states. [2019-01-12 22:22:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45605 states to 45605 states and 185365 transitions. [2019-01-12 22:22:08,703 INFO L78 Accepts]: Start accepts. Automaton has 45605 states and 185365 transitions. Word has length 50 [2019-01-12 22:22:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:08,703 INFO L480 AbstractCegarLoop]: Abstraction has 45605 states and 185365 transitions. [2019-01-12 22:22:08,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 22:22:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 45605 states and 185365 transitions. [2019-01-12 22:22:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 22:22:08,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:08,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:08,740 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1695764147, now seen corresponding path program 2 times [2019-01-12 22:22:08,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:08,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:08,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:08,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:08,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:09,215 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:22:09,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:09,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-12 22:22:09,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 22:22:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 22:22:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:22:09,216 INFO L87 Difference]: Start difference. First operand 45605 states and 185365 transitions. Second operand 14 states. [2019-01-12 22:22:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:10,626 INFO L93 Difference]: Finished difference Result 56309 states and 228050 transitions. [2019-01-12 22:22:10,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:22:10,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-01-12 22:22:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:10,774 INFO L225 Difference]: With dead ends: 56309 [2019-01-12 22:22:10,774 INFO L226 Difference]: Without dead ends: 55853 [2019-01-12 22:22:10,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-01-12 22:22:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55853 states. [2019-01-12 22:22:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55853 to 45484. [2019-01-12 22:22:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45484 states. [2019-01-12 22:22:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45484 states to 45484 states and 185020 transitions. [2019-01-12 22:22:11,702 INFO L78 Accepts]: Start accepts. Automaton has 45484 states and 185020 transitions. Word has length 50 [2019-01-12 22:22:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:11,702 INFO L480 AbstractCegarLoop]: Abstraction has 45484 states and 185020 transitions. [2019-01-12 22:22:11,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 22:22:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 45484 states and 185020 transitions. [2019-01-12 22:22:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 22:22:11,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:11,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:11,736 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1546975859, now seen corresponding path program 1 times [2019-01-12 22:22:11,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:11,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:11,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:11,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:22:11,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:12,086 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:22:12,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:12,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 22:22:12,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 22:22:12,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 22:22:12,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:22:12,087 INFO L87 Difference]: Start difference. First operand 45484 states and 185020 transitions. Second operand 11 states. [2019-01-12 22:22:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:12,931 INFO L93 Difference]: Finished difference Result 56683 states and 227434 transitions. [2019-01-12 22:22:12,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:22:12,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-01-12 22:22:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:13,058 INFO L225 Difference]: With dead ends: 56683 [2019-01-12 22:22:13,058 INFO L226 Difference]: Without dead ends: 51108 [2019-01-12 22:22:13,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2019-01-12 22:22:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51108 states. [2019-01-12 22:22:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51108 to 44884. [2019-01-12 22:22:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44884 states. [2019-01-12 22:22:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44884 states to 44884 states and 182725 transitions. [2019-01-12 22:22:13,924 INFO L78 Accepts]: Start accepts. Automaton has 44884 states and 182725 transitions. Word has length 50 [2019-01-12 22:22:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:13,924 INFO L480 AbstractCegarLoop]: Abstraction has 44884 states and 182725 transitions. [2019-01-12 22:22:13,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 22:22:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 44884 states and 182725 transitions. [2019-01-12 22:22:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 22:22:13,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:13,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:13,973 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:13,974 INFO L82 PathProgramCache]: Analyzing trace with hash -295598450, now seen corresponding path program 1 times [2019-01-12 22:22:13,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:13,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:13,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:14,769 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:22:14,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:14,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:22:14,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:22:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:22:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:22:14,770 INFO L87 Difference]: Start difference. First operand 44884 states and 182725 transitions. Second operand 18 states. [2019-01-12 22:22:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:16,557 INFO L93 Difference]: Finished difference Result 53871 states and 220082 transitions. [2019-01-12 22:22:16,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:22:16,559 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-01-12 22:22:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:16,708 INFO L225 Difference]: With dead ends: 53871 [2019-01-12 22:22:16,708 INFO L226 Difference]: Without dead ends: 53415 [2019-01-12 22:22:16,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2019-01-12 22:22:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53415 states. [2019-01-12 22:22:17,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53415 to 44259. [2019-01-12 22:22:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44259 states. [2019-01-12 22:22:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44259 states to 44259 states and 180398 transitions. [2019-01-12 22:22:18,095 INFO L78 Accepts]: Start accepts. Automaton has 44259 states and 180398 transitions. Word has length 52 [2019-01-12 22:22:18,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:18,095 INFO L480 AbstractCegarLoop]: Abstraction has 44259 states and 180398 transitions. [2019-01-12 22:22:18,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:22:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 44259 states and 180398 transitions. [2019-01-12 22:22:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 22:22:18,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:18,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:18,153 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:18,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:18,153 INFO L82 PathProgramCache]: Analyzing trace with hash 897864341, now seen corresponding path program 1 times [2019-01-12 22:22:18,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:18,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:18,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:18,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:18,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:19,537 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:22:19,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:19,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-12 22:22:19,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 22:22:19,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 22:22:19,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:22:19,538 INFO L87 Difference]: Start difference. First operand 44259 states and 180398 transitions. Second operand 20 states. [2019-01-12 22:22:20,169 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-01-12 22:22:20,399 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-01-12 22:22:20,611 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-01-12 22:22:20,776 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-01-12 22:22:20,966 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2019-01-12 22:22:21,139 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-01-12 22:22:21,336 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2019-01-12 22:22:21,576 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 66 [2019-01-12 22:22:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:22,218 INFO L93 Difference]: Finished difference Result 49438 states and 198818 transitions. [2019-01-12 22:22:22,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 22:22:22,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2019-01-12 22:22:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:22,329 INFO L225 Difference]: With dead ends: 49438 [2019-01-12 22:22:22,329 INFO L226 Difference]: Without dead ends: 48538 [2019-01-12 22:22:22,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2019-01-12 22:22:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48538 states. [2019-01-12 22:22:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48538 to 45441. [2019-01-12 22:22:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45441 states. [2019-01-12 22:22:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45441 states to 45441 states and 183672 transitions. [2019-01-12 22:22:23,172 INFO L78 Accepts]: Start accepts. Automaton has 45441 states and 183672 transitions. Word has length 53 [2019-01-12 22:22:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:23,172 INFO L480 AbstractCegarLoop]: Abstraction has 45441 states and 183672 transitions. [2019-01-12 22:22:23,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 22:22:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 45441 states and 183672 transitions. [2019-01-12 22:22:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 22:22:23,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:23,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:23,215 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1410636712, now seen corresponding path program 1 times [2019-01-12 22:22:23,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:23,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:23,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:23,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:23,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:23,542 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:22:23,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:23,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 22:22:23,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 22:22:23,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 22:22:23,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:22:23,544 INFO L87 Difference]: Start difference. First operand 45441 states and 183672 transitions. Second operand 13 states. [2019-01-12 22:22:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:24,508 INFO L93 Difference]: Finished difference Result 64750 states and 258658 transitions. [2019-01-12 22:22:24,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:22:24,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-01-12 22:22:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:24,645 INFO L225 Difference]: With dead ends: 64750 [2019-01-12 22:22:24,646 INFO L226 Difference]: Without dead ends: 56480 [2019-01-12 22:22:24,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:22:24,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56480 states. [2019-01-12 22:22:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56480 to 44979. [2019-01-12 22:22:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44979 states. [2019-01-12 22:22:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44979 states to 44979 states and 181804 transitions. [2019-01-12 22:22:26,081 INFO L78 Accepts]: Start accepts. Automaton has 44979 states and 181804 transitions. Word has length 53 [2019-01-12 22:22:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:26,081 INFO L480 AbstractCegarLoop]: Abstraction has 44979 states and 181804 transitions. [2019-01-12 22:22:26,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 22:22:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44979 states and 181804 transitions. [2019-01-12 22:22:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 22:22:26,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:26,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:26,125 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:26,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:26,125 INFO L82 PathProgramCache]: Analyzing trace with hash 48691382, now seen corresponding path program 1 times [2019-01-12 22:22:26,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:26,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:26,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:27,337 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:22:27,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:27,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-12 22:22:27,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 22:22:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 22:22:27,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:22:27,338 INFO L87 Difference]: Start difference. First operand 44979 states and 181804 transitions. Second operand 20 states. [2019-01-12 22:22:28,413 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-01-12 22:22:28,604 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-01-12 22:22:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:29,870 INFO L93 Difference]: Finished difference Result 50667 states and 202225 transitions. [2019-01-12 22:22:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:22:29,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2019-01-12 22:22:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:29,983 INFO L225 Difference]: With dead ends: 50667 [2019-01-12 22:22:29,984 INFO L226 Difference]: Without dead ends: 48513 [2019-01-12 22:22:29,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2019-01-12 22:22:30,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48513 states. [2019-01-12 22:22:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48513 to 45399. [2019-01-12 22:22:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45399 states. [2019-01-12 22:22:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45399 states to 45399 states and 181954 transitions. [2019-01-12 22:22:30,812 INFO L78 Accepts]: Start accepts. Automaton has 45399 states and 181954 transitions. Word has length 53 [2019-01-12 22:22:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:30,813 INFO L480 AbstractCegarLoop]: Abstraction has 45399 states and 181954 transitions. [2019-01-12 22:22:30,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 22:22:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 45399 states and 181954 transitions. [2019-01-12 22:22:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 22:22:30,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:30,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:30,856 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash 548692374, now seen corresponding path program 2 times [2019-01-12 22:22:30,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:30,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:30,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:30,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:30,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:31,429 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-01-12 22:22:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:22:31,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:31,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 22:22:31,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:22:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:22:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:22:31,917 INFO L87 Difference]: Start difference. First operand 45399 states and 181954 transitions. Second operand 16 states. [2019-01-12 22:22:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:32,945 INFO L93 Difference]: Finished difference Result 48012 states and 188925 transitions. [2019-01-12 22:22:32,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 22:22:32,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-01-12 22:22:32,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:33,050 INFO L225 Difference]: With dead ends: 48012 [2019-01-12 22:22:33,050 INFO L226 Difference]: Without dead ends: 46281 [2019-01-12 22:22:33,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2019-01-12 22:22:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46281 states. [2019-01-12 22:22:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46281 to 42627. [2019-01-12 22:22:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42627 states. [2019-01-12 22:22:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42627 states to 42627 states and 169324 transitions. [2019-01-12 22:22:33,853 INFO L78 Accepts]: Start accepts. Automaton has 42627 states and 169324 transitions. Word has length 53 [2019-01-12 22:22:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:33,853 INFO L480 AbstractCegarLoop]: Abstraction has 42627 states and 169324 transitions. [2019-01-12 22:22:33,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:22:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 42627 states and 169324 transitions. [2019-01-12 22:22:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 22:22:33,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:33,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:33,910 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash 199462923, now seen corresponding path program 2 times [2019-01-12 22:22:33,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:33,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:33,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:33,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:22:33,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:34,144 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:22:34,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:34,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:22:34,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:22:34,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:22:34,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:22:34,145 INFO L87 Difference]: Start difference. First operand 42627 states and 169324 transitions. Second operand 10 states. [2019-01-12 22:22:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:34,641 INFO L93 Difference]: Finished difference Result 39338 states and 153574 transitions. [2019-01-12 22:22:34,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:22:34,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-01-12 22:22:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:34,727 INFO L225 Difference]: With dead ends: 39338 [2019-01-12 22:22:34,727 INFO L226 Difference]: Without dead ends: 37580 [2019-01-12 22:22:34,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:22:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37580 states. [2019-01-12 22:22:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37580 to 33864. [2019-01-12 22:22:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33864 states. [2019-01-12 22:22:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33864 states to 33864 states and 133821 transitions. [2019-01-12 22:22:35,467 INFO L78 Accepts]: Start accepts. Automaton has 33864 states and 133821 transitions. Word has length 53 [2019-01-12 22:22:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:35,467 INFO L480 AbstractCegarLoop]: Abstraction has 33864 states and 133821 transitions. [2019-01-12 22:22:35,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:22:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 33864 states and 133821 transitions. [2019-01-12 22:22:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 22:22:35,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:35,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:35,504 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash -231145001, now seen corresponding path program 1 times [2019-01-12 22:22:35,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:35,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:35,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:35,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:22:35,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:36,348 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:22:36,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:36,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 22:22:36,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 22:22:36,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 22:22:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:22:36,351 INFO L87 Difference]: Start difference. First operand 33864 states and 133821 transitions. Second operand 11 states. [2019-01-12 22:22:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:36,893 INFO L93 Difference]: Finished difference Result 34995 states and 136774 transitions. [2019-01-12 22:22:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:22:36,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-01-12 22:22:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:36,967 INFO L225 Difference]: With dead ends: 34995 [2019-01-12 22:22:36,967 INFO L226 Difference]: Without dead ends: 28626 [2019-01-12 22:22:36,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:22:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28626 states. [2019-01-12 22:22:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28626 to 26922. [2019-01-12 22:22:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26922 states. [2019-01-12 22:22:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26922 states to 26922 states and 106021 transitions. [2019-01-12 22:22:37,502 INFO L78 Accepts]: Start accepts. Automaton has 26922 states and 106021 transitions. Word has length 55 [2019-01-12 22:22:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:37,502 INFO L480 AbstractCegarLoop]: Abstraction has 26922 states and 106021 transitions. [2019-01-12 22:22:37,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 22:22:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 26922 states and 106021 transitions. [2019-01-12 22:22:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 22:22:37,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:37,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:37,537 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:37,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1655779279, now seen corresponding path program 1 times [2019-01-12 22:22:37,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:37,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:37,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:37,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:37,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:38,110 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:22:38,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:38,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 22:22:38,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:22:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:22:38,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:22:38,111 INFO L87 Difference]: Start difference. First operand 26922 states and 106021 transitions. Second operand 16 states. [2019-01-12 22:22:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:39,258 INFO L93 Difference]: Finished difference Result 32056 states and 125113 transitions. [2019-01-12 22:22:39,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 22:22:39,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-01-12 22:22:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:39,336 INFO L225 Difference]: With dead ends: 32056 [2019-01-12 22:22:39,336 INFO L226 Difference]: Without dead ends: 31591 [2019-01-12 22:22:39,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2019-01-12 22:22:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31591 states. [2019-01-12 22:22:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31591 to 25839. [2019-01-12 22:22:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25839 states. [2019-01-12 22:22:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25839 states to 25839 states and 101780 transitions. [2019-01-12 22:22:39,873 INFO L78 Accepts]: Start accepts. Automaton has 25839 states and 101780 transitions. Word has length 55 [2019-01-12 22:22:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:39,874 INFO L480 AbstractCegarLoop]: Abstraction has 25839 states and 101780 transitions. [2019-01-12 22:22:39,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:22:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 25839 states and 101780 transitions. [2019-01-12 22:22:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 22:22:39,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:39,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:39,903 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:39,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1464700077, now seen corresponding path program 1 times [2019-01-12 22:22:39,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:39,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:39,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:39,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:39,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:40,381 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-01-12 22:22:40,614 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:22:40,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:40,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 22:22:40,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 22:22:40,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 22:22:40,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:22:40,615 INFO L87 Difference]: Start difference. First operand 25839 states and 101780 transitions. Second operand 11 states. [2019-01-12 22:22:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:41,047 INFO L93 Difference]: Finished difference Result 27453 states and 107751 transitions. [2019-01-12 22:22:41,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:22:41,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-01-12 22:22:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:41,113 INFO L225 Difference]: With dead ends: 27453 [2019-01-12 22:22:41,114 INFO L226 Difference]: Without dead ends: 25839 [2019-01-12 22:22:41,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:22:41,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25839 states. [2019-01-12 22:22:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25839 to 25119. [2019-01-12 22:22:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25119 states. [2019-01-12 22:22:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25119 states to 25119 states and 99136 transitions. [2019-01-12 22:22:41,586 INFO L78 Accepts]: Start accepts. Automaton has 25119 states and 99136 transitions. Word has length 55 [2019-01-12 22:22:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:41,586 INFO L480 AbstractCegarLoop]: Abstraction has 25119 states and 99136 transitions. [2019-01-12 22:22:41,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 22:22:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 25119 states and 99136 transitions. [2019-01-12 22:22:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 22:22:41,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:41,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:41,613 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:41,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:41,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2007864715, now seen corresponding path program 2 times [2019-01-12 22:22:41,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:41,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:41,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:41,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:41,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:42,238 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-01-12 22:22:42,371 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-12 22:22:42,833 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:22:42,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:42,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:22:42,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:22:42,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:22:42,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:22:42,834 INFO L87 Difference]: Start difference. First operand 25119 states and 99136 transitions. Second operand 18 states. [2019-01-12 22:22:43,806 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-01-12 22:22:44,004 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-01-12 22:22:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:44,350 INFO L93 Difference]: Finished difference Result 20716 states and 80053 transitions. [2019-01-12 22:22:44,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:22:44,352 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-01-12 22:22:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:44,388 INFO L225 Difference]: With dead ends: 20716 [2019-01-12 22:22:44,389 INFO L226 Difference]: Without dead ends: 16555 [2019-01-12 22:22:44,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2019-01-12 22:22:44,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16555 states. [2019-01-12 22:22:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16555 to 12671. [2019-01-12 22:22:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12671 states. [2019-01-12 22:22:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12671 states to 12671 states and 48514 transitions. [2019-01-12 22:22:44,636 INFO L78 Accepts]: Start accepts. Automaton has 12671 states and 48514 transitions. Word has length 55 [2019-01-12 22:22:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:44,637 INFO L480 AbstractCegarLoop]: Abstraction has 12671 states and 48514 transitions. [2019-01-12 22:22:44,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:22:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 12671 states and 48514 transitions. [2019-01-12 22:22:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 22:22:44,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:44,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:44,651 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:44,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:44,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1637424555, now seen corresponding path program 1 times [2019-01-12 22:22:44,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:44,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:44,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:44,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:22:44,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:44,936 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 22:22:45,329 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-01-12 22:22:45,880 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:22:45,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:45,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:22:45,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:22:45,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:22:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:22:45,881 INFO L87 Difference]: Start difference. First operand 12671 states and 48514 transitions. Second operand 18 states. [2019-01-12 22:22:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:46,718 INFO L93 Difference]: Finished difference Result 13991 states and 52930 transitions. [2019-01-12 22:22:46,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:22:46,719 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2019-01-12 22:22:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:46,742 INFO L225 Difference]: With dead ends: 13991 [2019-01-12 22:22:46,742 INFO L226 Difference]: Without dead ends: 10031 [2019-01-12 22:22:46,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2019-01-12 22:22:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10031 states. [2019-01-12 22:22:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10031 to 10031. [2019-01-12 22:22:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10031 states. [2019-01-12 22:22:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10031 states to 10031 states and 36978 transitions. [2019-01-12 22:22:46,903 INFO L78 Accepts]: Start accepts. Automaton has 10031 states and 36978 transitions. Word has length 58 [2019-01-12 22:22:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:46,904 INFO L480 AbstractCegarLoop]: Abstraction has 10031 states and 36978 transitions. [2019-01-12 22:22:46,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:22:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 10031 states and 36978 transitions. [2019-01-12 22:22:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 22:22:46,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:46,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:46,916 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1019541803, now seen corresponding path program 2 times [2019-01-12 22:22:46,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:46,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:46,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:46,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:46,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:48,147 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-01-12 22:22:48,484 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:22:48,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:48,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:22:48,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:22:48,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:22:48,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:22:48,485 INFO L87 Difference]: Start difference. First operand 10031 states and 36978 transitions. Second operand 18 states. [2019-01-12 22:22:49,057 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-01-12 22:22:49,456 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-01-12 22:22:49,638 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-01-12 22:22:49,887 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-01-12 22:22:50,194 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-01-12 22:22:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:50,417 INFO L93 Difference]: Finished difference Result 8951 states and 31914 transitions. [2019-01-12 22:22:50,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 22:22:50,418 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2019-01-12 22:22:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:50,434 INFO L225 Difference]: With dead ends: 8951 [2019-01-12 22:22:50,435 INFO L226 Difference]: Without dead ends: 7461 [2019-01-12 22:22:50,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2019-01-12 22:22:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2019-01-12 22:22:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7461. [2019-01-12 22:22:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7461 states. [2019-01-12 22:22:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 27015 transitions. [2019-01-12 22:22:50,632 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 27015 transitions. Word has length 58 [2019-01-12 22:22:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:50,633 INFO L480 AbstractCegarLoop]: Abstraction has 7461 states and 27015 transitions. [2019-01-12 22:22:50,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:22:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 27015 transitions. [2019-01-12 22:22:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-12 22:22:50,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:50,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:50,641 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:50,641 INFO L82 PathProgramCache]: Analyzing trace with hash -726446296, now seen corresponding path program 1 times [2019-01-12 22:22:50,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:50,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:50,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:50,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:22:50,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:51,650 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:22:51,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:51,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-12 22:22:51,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 22:22:51,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 22:22:51,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:22:51,652 INFO L87 Difference]: Start difference. First operand 7461 states and 27015 transitions. Second operand 20 states. [2019-01-12 22:22:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:52,244 INFO L93 Difference]: Finished difference Result 4869 states and 16887 transitions. [2019-01-12 22:22:52,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:22:52,246 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-01-12 22:22:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:52,254 INFO L225 Difference]: With dead ends: 4869 [2019-01-12 22:22:52,254 INFO L226 Difference]: Without dead ends: 3549 [2019-01-12 22:22:52,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-01-12 22:22:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2019-01-12 22:22:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3549. [2019-01-12 22:22:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2019-01-12 22:22:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 12499 transitions. [2019-01-12 22:22:52,304 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 12499 transitions. Word has length 60 [2019-01-12 22:22:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:52,305 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 12499 transitions. [2019-01-12 22:22:52,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 22:22:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 12499 transitions. [2019-01-12 22:22:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-12 22:22:52,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:22:52,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:22:52,309 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:22:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:22:52,309 INFO L82 PathProgramCache]: Analyzing trace with hash 314196332, now seen corresponding path program 1 times [2019-01-12 22:22:52,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:22:52,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:22:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:52,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:22:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:22:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:22:52,955 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:22:52,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:22:52,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:22:52,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:22:52,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:22:52,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:22:52,957 INFO L87 Difference]: Start difference. First operand 3549 states and 12499 transitions. Second operand 18 states. [2019-01-12 22:22:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:22:54,183 INFO L93 Difference]: Finished difference Result 882 states and 2688 transitions. [2019-01-12 22:22:54,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:22:54,184 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-01-12 22:22:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:22:54,184 INFO L225 Difference]: With dead ends: 882 [2019-01-12 22:22:54,184 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 22:22:54,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:22:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 22:22:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 22:22:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 22:22:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 22:22:54,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2019-01-12 22:22:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:22:54,186 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 22:22:54,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:22:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 22:22:54,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 22:22:54,189 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 22:22:54,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:22:54 BasicIcfg [2019-01-12 22:22:54,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 22:22:54,192 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 22:22:54,192 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 22:22:54,192 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 22:22:54,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:21:35" (3/4) ... [2019-01-12 22:22:54,196 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 22:22:54,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread0 [2019-01-12 22:22:54,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2019-01-12 22:22:54,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2019-01-12 22:22:54,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2019-01-12 22:22:54,207 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-01-12 22:22:54,208 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 22:22:54,247 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 22:22:54,248 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 22:22:54,249 INFO L168 Benchmark]: Toolchain (without parser) took 80809.37 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 940.6 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-12 22:22:54,250 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:22:54,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -139.6 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-01-12 22:22:54,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 22:22:54,253 INFO L168 Benchmark]: Boogie Preprocessor took 33.56 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:22:54,254 INFO L168 Benchmark]: RCFGBuilder took 659.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-12 22:22:54,254 INFO L168 Benchmark]: TraceAbstraction took 79091.74 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-12 22:22:54,256 INFO L168 Benchmark]: Witness Printer took 56.43 ms. Allocated memory is still 5.3 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 181.3 kB). Peak memory consumption was 181.3 kB. Max. memory is 11.5 GB. [2019-01-12 22:22:54,261 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 898.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -139.6 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.56 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 659.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79091.74 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 56.43 ms. Allocated memory is still 5.3 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 181.3 kB). Peak memory consumption was 181.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 172 locations, 1 error locations. SAFE Result, 78.3s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 32.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5004 SDtfs, 12439 SDslu, 21142 SDs, 0 SdLazy, 8061 SolverSat, 1294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 70 SyntacticMatches, 23 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 23.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60962occurred 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: 24.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 131462 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 1216 NumberOfCodeBlocks, 1216 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1192 ConstructedInterpolants, 0 QuantifiedInterpolants, 829098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...