./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer --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.23-635dfa2 [2018-12-08 17:33:10,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:33:10,397 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:33:10,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:33:10,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:33:10,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:33:10,404 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:33:10,405 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:33:10,406 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:33:10,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:33:10,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:33:10,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:33:10,407 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:33:10,408 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:33:10,408 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:33:10,409 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:33:10,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:33:10,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:33:10,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:33:10,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:33:10,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:33:10,413 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:33:10,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:33:10,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:33:10,414 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:33:10,415 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:33:10,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:33:10,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:33:10,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:33:10,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:33:10,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:33:10,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:33:10,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:33:10,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:33:10,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:33:10,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:33:10,418 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 17:33:10,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:33:10,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:33:10,425 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:33:10,425 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:33:10,426 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:33:10,426 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:33:10,426 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 17:33:10,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:33:10,426 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:33:10,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:33:10,426 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:33:10,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:33:10,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:33:10,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:33:10,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:33:10,427 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:33:10,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:33:10,427 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:33:10,427 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:33:10,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:33:10,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:33:10,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:33:10,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:33:10,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:33:10,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:33:10,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:33:10,428 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:33:10,428 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 17:33:10,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:33:10,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:33:10,428 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer 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 [2018-12-08 17:33:10,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:33:10,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:33:10,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:33:10,458 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:33:10,458 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:33:10,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2018-12-08 17:33:10,494 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/data/721d1327b/92a36abe0cc049658aca343e006eb11a/FLAG50e3ce5d6 [2018-12-08 17:33:10,966 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:33:10,967 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2018-12-08 17:33:10,974 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/data/721d1327b/92a36abe0cc049658aca343e006eb11a/FLAG50e3ce5d6 [2018-12-08 17:33:10,984 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/data/721d1327b/92a36abe0cc049658aca343e006eb11a [2018-12-08 17:33:10,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:33:10,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:33:10,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:33:10,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:33:10,989 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:33:10,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:33:10" (1/1) ... [2018-12-08 17:33:10,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f76134a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:10, skipping insertion in model container [2018-12-08 17:33:10,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:33:10" (1/1) ... [2018-12-08 17:33:10,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:33:11,017 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:33:11,246 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:33:11,252 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:33:11,312 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:33:11,378 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:33:11,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11 WrapperNode [2018-12-08 17:33:11,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:33:11,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:33:11,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:33:11,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:33:11,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (1/1) ... [2018-12-08 17:33:11,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (1/1) ... [2018-12-08 17:33:11,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:33:11,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:33:11,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:33:11,408 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:33:11,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (1/1) ... [2018-12-08 17:33:11,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (1/1) ... [2018-12-08 17:33:11,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (1/1) ... [2018-12-08 17:33:11,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (1/1) ... [2018-12-08 17:33:11,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (1/1) ... [2018-12-08 17:33:11,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (1/1) ... [2018-12-08 17:33:11,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (1/1) ... [2018-12-08 17:33:11,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:33:11,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:33:11,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:33:11,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:33:11,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:33:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:33:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:33:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 17:33:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-12-08 17:33:11,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-12-08 17:33:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-12-08 17:33:11,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-12-08 17:33:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-12-08 17:33:11,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-12-08 17:33:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-12-08 17:33:11,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-12-08 17:33:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:33:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:33:11,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:33:11,457 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 17:33:11,651 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:33:11,652 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-08 17:33:11,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:33:11 BoogieIcfgContainer [2018-12-08 17:33:11,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:33:11,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:33:11,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:33:11,655 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:33:11,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:33:10" (1/3) ... [2018-12-08 17:33:11,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382a3edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:33:11, skipping insertion in model container [2018-12-08 17:33:11,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:11" (2/3) ... [2018-12-08 17:33:11,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382a3edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:33:11, skipping insertion in model container [2018-12-08 17:33:11,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:33:11" (3/3) ... [2018-12-08 17:33:11,658 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems_true-unreach-call.i [2018-12-08 17:33:11,688 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,688 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,688 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,689 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,689 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,689 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,689 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,689 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,690 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,690 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,690 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,690 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,690 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,690 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,691 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,691 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,691 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,691 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,691 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,691 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,692 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,692 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,692 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,693 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,693 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,693 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,693 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,693 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,693 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,694 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,695 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,695 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,695 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,695 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,695 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,695 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,695 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,695 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,696 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,696 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,696 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,696 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,696 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,697 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,697 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,697 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,697 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,697 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,697 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,697 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,698 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,698 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,698 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,698 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,698 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,698 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,699 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,699 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,699 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,699 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,699 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,699 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,700 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,700 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,700 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,700 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,700 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,701 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,701 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,701 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,701 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,701 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,702 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,702 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,703 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,703 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,703 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,703 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,703 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,703 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,704 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,704 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:11,794 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 17:33:11,794 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:33:11,799 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 17:33:11,808 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 17:33:11,823 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 17:33:11,824 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:33:11,824 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:33:11,824 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:33:11,824 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:33:11,824 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:33:11,824 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:33:11,824 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:33:11,824 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:33:11,832 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 239 transitions [2018-12-08 17:33:14,730 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 60962 states. [2018-12-08 17:33:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 60962 states. [2018-12-08 17:33:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:33:14,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:14,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:14,740 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:14,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1451762756, now seen corresponding path program 1 times [2018-12-08 17:33:14,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:14,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:14,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:14,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:14,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:14,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:14,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:33:14,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:33:14,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:33:14,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:33:14,921 INFO L87 Difference]: Start difference. First operand 60962 states. Second operand 5 states. [2018-12-08 17:33:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:15,422 INFO L93 Difference]: Finished difference Result 90537 states and 379072 transitions. [2018-12-08 17:33:15,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:33:15,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-08 17:33:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:15,585 INFO L225 Difference]: With dead ends: 90537 [2018-12-08 17:33:15,585 INFO L226 Difference]: Without dead ends: 40487 [2018-12-08 17:33:15,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:33:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40487 states. [2018-12-08 17:33:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40487 to 40487. [2018-12-08 17:33:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40487 states. [2018-12-08 17:33:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40487 states to 40487 states and 173218 transitions. [2018-12-08 17:33:16,431 INFO L78 Accepts]: Start accepts. Automaton has 40487 states and 173218 transitions. Word has length 33 [2018-12-08 17:33:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:16,431 INFO L480 AbstractCegarLoop]: Abstraction has 40487 states and 173218 transitions. [2018-12-08 17:33:16,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:33:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 40487 states and 173218 transitions. [2018-12-08 17:33:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:33:16,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:16,433 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] [2018-12-08 17:33:16,433 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:16,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:16,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1742157727, now seen corresponding path program 1 times [2018-12-08 17:33:16,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:16,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:16,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:16,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:16,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:33:16,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:33:16,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:33:16,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:33:16,536 INFO L87 Difference]: Start difference. First operand 40487 states and 173218 transitions. Second operand 10 states. [2018-12-08 17:33:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:17,045 INFO L93 Difference]: Finished difference Result 47144 states and 204499 transitions. [2018-12-08 17:33:17,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:33:17,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-08 17:33:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:17,153 INFO L225 Difference]: With dead ends: 47144 [2018-12-08 17:33:17,153 INFO L226 Difference]: Without dead ends: 47144 [2018-12-08 17:33:17,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:33:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47144 states. [2018-12-08 17:33:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47144 to 40505. [2018-12-08 17:33:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40505 states. [2018-12-08 17:33:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40505 states to 40505 states and 173247 transitions. [2018-12-08 17:33:18,064 INFO L78 Accepts]: Start accepts. Automaton has 40505 states and 173247 transitions. Word has length 35 [2018-12-08 17:33:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:18,064 INFO L480 AbstractCegarLoop]: Abstraction has 40505 states and 173247 transitions. [2018-12-08 17:33:18,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:33:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 40505 states and 173247 transitions. [2018-12-08 17:33:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:33:18,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:18,066 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] [2018-12-08 17:33:18,066 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:18,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:18,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1856245215, now seen corresponding path program 2 times [2018-12-08 17:33:18,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:18,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:18,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:18,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:18,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:33:18,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:33:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:33:18,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:33:18,160 INFO L87 Difference]: Start difference. First operand 40505 states and 173247 transitions. Second operand 10 states. [2018-12-08 17:33:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:18,601 INFO L93 Difference]: Finished difference Result 53745 states and 235686 transitions. [2018-12-08 17:33:18,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:33:18,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-08 17:33:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:18,712 INFO L225 Difference]: With dead ends: 53745 [2018-12-08 17:33:18,712 INFO L226 Difference]: Without dead ends: 53745 [2018-12-08 17:33:18,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:33:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53745 states. [2018-12-08 17:33:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53745 to 40451. [2018-12-08 17:33:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40451 states. [2018-12-08 17:33:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40451 states to 40451 states and 173155 transitions. [2018-12-08 17:33:19,541 INFO L78 Accepts]: Start accepts. Automaton has 40451 states and 173155 transitions. Word has length 35 [2018-12-08 17:33:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:19,541 INFO L480 AbstractCegarLoop]: Abstraction has 40451 states and 173155 transitions. [2018-12-08 17:33:19,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:33:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 40451 states and 173155 transitions. [2018-12-08 17:33:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 17:33:19,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:19,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:19,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:19,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash 864239609, now seen corresponding path program 1 times [2018-12-08 17:33:19,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:19,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:19,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:19,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:19,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:19,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:33:19,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:33:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:33:19,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:33:19,588 INFO L87 Difference]: Start difference. First operand 40451 states and 173155 transitions. Second operand 5 states. [2018-12-08 17:33:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:19,915 INFO L93 Difference]: Finished difference Result 74947 states and 314581 transitions. [2018-12-08 17:33:19,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:33:19,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-08 17:33:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:20,026 INFO L225 Difference]: With dead ends: 74947 [2018-12-08 17:33:20,026 INFO L226 Difference]: Without dead ends: 56513 [2018-12-08 17:33:20,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:33:20,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56513 states. [2018-12-08 17:33:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56513 to 40763. [2018-12-08 17:33:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40763 states. [2018-12-08 17:33:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40763 states to 40763 states and 169305 transitions. [2018-12-08 17:33:20,942 INFO L78 Accepts]: Start accepts. Automaton has 40763 states and 169305 transitions. Word has length 45 [2018-12-08 17:33:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:20,942 INFO L480 AbstractCegarLoop]: Abstraction has 40763 states and 169305 transitions. [2018-12-08 17:33:20,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:33:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 40763 states and 169305 transitions. [2018-12-08 17:33:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:33:20,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:20,956 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] [2018-12-08 17:33:20,956 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:20,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:20,956 INFO L82 PathProgramCache]: Analyzing trace with hash 967863130, now seen corresponding path program 1 times [2018-12-08 17:33:20,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:20,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:21,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:21,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 17:33:21,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 17:33:21,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 17:33:21,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:33:21,322 INFO L87 Difference]: Start difference. First operand 40763 states and 169305 transitions. Second operand 19 states. [2018-12-08 17:33:21,688 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-12-08 17:33:22,373 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-12-08 17:33:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:23,281 INFO L93 Difference]: Finished difference Result 58950 states and 239857 transitions. [2018-12-08 17:33:23,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 17:33:23,281 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-12-08 17:33:23,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:23,390 INFO L225 Difference]: With dead ends: 58950 [2018-12-08 17:33:23,390 INFO L226 Difference]: Without dead ends: 56542 [2018-12-08 17:33:23,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2018-12-08 17:33:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56542 states. [2018-12-08 17:33:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56542 to 40733. [2018-12-08 17:33:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40733 states. [2018-12-08 17:33:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40733 states to 40733 states and 169201 transitions. [2018-12-08 17:33:25,087 INFO L78 Accepts]: Start accepts. Automaton has 40733 states and 169201 transitions. Word has length 47 [2018-12-08 17:33:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:25,088 INFO L480 AbstractCegarLoop]: Abstraction has 40733 states and 169201 transitions. [2018-12-08 17:33:25,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 17:33:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 40733 states and 169201 transitions. [2018-12-08 17:33:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:33:25,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:25,099 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] [2018-12-08 17:33:25,099 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:25,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash 565489518, now seen corresponding path program 2 times [2018-12-08 17:33:25,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:25,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:25,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:25,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:25,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:25,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:25,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 17:33:25,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:33:25,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:33:25,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:33:25,165 INFO L87 Difference]: Start difference. First operand 40733 states and 169201 transitions. Second operand 9 states. [2018-12-08 17:33:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:25,532 INFO L93 Difference]: Finished difference Result 58841 states and 239535 transitions. [2018-12-08 17:33:25,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:33:25,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-12-08 17:33:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:25,641 INFO L225 Difference]: With dead ends: 58841 [2018-12-08 17:33:25,642 INFO L226 Difference]: Without dead ends: 56433 [2018-12-08 17:33:25,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:33:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56433 states. [2018-12-08 17:33:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56433 to 40658. [2018-12-08 17:33:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40658 states. [2018-12-08 17:33:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40658 states to 40658 states and 168991 transitions. [2018-12-08 17:33:26,349 INFO L78 Accepts]: Start accepts. Automaton has 40658 states and 168991 transitions. Word has length 47 [2018-12-08 17:33:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:26,349 INFO L480 AbstractCegarLoop]: Abstraction has 40658 states and 168991 transitions. [2018-12-08 17:33:26,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:33:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 40658 states and 168991 transitions. [2018-12-08 17:33:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:33:26,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:26,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:26,365 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:26,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:26,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1318988660, now seen corresponding path program 1 times [2018-12-08 17:33:26,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:26,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:26,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:26,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:26,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:26,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:26,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:33:26,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:33:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:33:26,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:33:26,405 INFO L87 Difference]: Start difference. First operand 40658 states and 168991 transitions. Second operand 7 states. [2018-12-08 17:33:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:26,793 INFO L93 Difference]: Finished difference Result 71197 states and 287728 transitions. [2018-12-08 17:33:26,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:33:26,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-08 17:33:26,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:26,880 INFO L225 Difference]: With dead ends: 71197 [2018-12-08 17:33:26,880 INFO L226 Difference]: Without dead ends: 48359 [2018-12-08 17:33:26,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:33:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48359 states. [2018-12-08 17:33:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48359 to 42374. [2018-12-08 17:33:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42374 states. [2018-12-08 17:33:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42374 states to 42374 states and 171196 transitions. [2018-12-08 17:33:27,641 INFO L78 Accepts]: Start accepts. Automaton has 42374 states and 171196 transitions. Word has length 48 [2018-12-08 17:33:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:27,641 INFO L480 AbstractCegarLoop]: Abstraction has 42374 states and 171196 transitions. [2018-12-08 17:33:27,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:33:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 42374 states and 171196 transitions. [2018-12-08 17:33:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 17:33:27,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:27,662 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] [2018-12-08 17:33:27,662 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:27,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash 183508982, now seen corresponding path program 1 times [2018-12-08 17:33:27,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:27,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:27,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:27,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:27,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:27,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:27,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 17:33:27,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:33:27,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:33:27,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:33:27,795 INFO L87 Difference]: Start difference. First operand 42374 states and 171196 transitions. Second operand 13 states. [2018-12-08 17:33:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:28,225 INFO L93 Difference]: Finished difference Result 54161 states and 215849 transitions. [2018-12-08 17:33:28,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:33:28,225 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-12-08 17:33:28,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:28,322 INFO L225 Difference]: With dead ends: 54161 [2018-12-08 17:33:28,322 INFO L226 Difference]: Without dead ends: 50905 [2018-12-08 17:33:28,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:33:28,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50905 states. [2018-12-08 17:33:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50905 to 42044. [2018-12-08 17:33:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42044 states. [2018-12-08 17:33:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42044 states to 42044 states and 169930 transitions. [2018-12-08 17:33:28,972 INFO L78 Accepts]: Start accepts. Automaton has 42044 states and 169930 transitions. Word has length 50 [2018-12-08 17:33:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:28,972 INFO L480 AbstractCegarLoop]: Abstraction has 42044 states and 169930 transitions. [2018-12-08 17:33:28,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:33:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 42044 states and 169930 transitions. [2018-12-08 17:33:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 17:33:28,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:28,994 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] [2018-12-08 17:33:28,994 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:28,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:28,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1136732819, now seen corresponding path program 1 times [2018-12-08 17:33:28,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:28,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:28,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:28,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:28,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:29,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:29,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-08 17:33:29,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:33:29,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:33:29,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:33:29,272 INFO L87 Difference]: Start difference. First operand 42044 states and 169930 transitions. Second operand 17 states. [2018-12-08 17:33:30,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:30,030 INFO L93 Difference]: Finished difference Result 48342 states and 195029 transitions. [2018-12-08 17:33:30,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:33:30,030 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-12-08 17:33:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:30,114 INFO L225 Difference]: With dead ends: 48342 [2018-12-08 17:33:30,114 INFO L226 Difference]: Without dead ends: 47886 [2018-12-08 17:33:30,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-12-08 17:33:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47886 states. [2018-12-08 17:33:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47886 to 45629. [2018-12-08 17:33:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45629 states. [2018-12-08 17:33:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45629 states to 45629 states and 185453 transitions. [2018-12-08 17:33:30,836 INFO L78 Accepts]: Start accepts. Automaton has 45629 states and 185453 transitions. Word has length 50 [2018-12-08 17:33:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:30,836 INFO L480 AbstractCegarLoop]: Abstraction has 45629 states and 185453 transitions. [2018-12-08 17:33:30,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:33:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45629 states and 185453 transitions. [2018-12-08 17:33:30,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 17:33:30,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:30,859 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] [2018-12-08 17:33:30,860 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:30,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:30,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1695764147, now seen corresponding path program 2 times [2018-12-08 17:33:30,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:30,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:30,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:30,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:30,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:31,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:31,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 17:33:31,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 17:33:31,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 17:33:31,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:33:31,017 INFO L87 Difference]: Start difference. First operand 45629 states and 185453 transitions. Second operand 14 states. [2018-12-08 17:33:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:31,500 INFO L93 Difference]: Finished difference Result 56333 states and 228138 transitions. [2018-12-08 17:33:31,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:33:31,500 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-08 17:33:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:31,606 INFO L225 Difference]: With dead ends: 56333 [2018-12-08 17:33:31,606 INFO L226 Difference]: Without dead ends: 55877 [2018-12-08 17:33:31,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-12-08 17:33:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55877 states. [2018-12-08 17:33:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55877 to 45508. [2018-12-08 17:33:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45508 states. [2018-12-08 17:33:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45508 states to 45508 states and 185108 transitions. [2018-12-08 17:33:32,323 INFO L78 Accepts]: Start accepts. Automaton has 45508 states and 185108 transitions. Word has length 50 [2018-12-08 17:33:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:32,323 INFO L480 AbstractCegarLoop]: Abstraction has 45508 states and 185108 transitions. [2018-12-08 17:33:32,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 17:33:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 45508 states and 185108 transitions. [2018-12-08 17:33:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 17:33:32,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:32,347 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] [2018-12-08 17:33:32,347 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:32,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1546975859, now seen corresponding path program 1 times [2018-12-08 17:33:32,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:32,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:32,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:32,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:32,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 17:33:32,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:33:32,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:33:32,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:33:32,422 INFO L87 Difference]: Start difference. First operand 45508 states and 185108 transitions. Second operand 11 states. [2018-12-08 17:33:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:32,845 INFO L93 Difference]: Finished difference Result 56707 states and 227522 transitions. [2018-12-08 17:33:32,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:33:32,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-12-08 17:33:32,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:32,939 INFO L225 Difference]: With dead ends: 56707 [2018-12-08 17:33:32,939 INFO L226 Difference]: Without dead ends: 51132 [2018-12-08 17:33:32,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2018-12-08 17:33:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51132 states. [2018-12-08 17:33:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51132 to 44908. [2018-12-08 17:33:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44908 states. [2018-12-08 17:33:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44908 states to 44908 states and 182813 transitions. [2018-12-08 17:33:33,783 INFO L78 Accepts]: Start accepts. Automaton has 44908 states and 182813 transitions. Word has length 50 [2018-12-08 17:33:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:33,783 INFO L480 AbstractCegarLoop]: Abstraction has 44908 states and 182813 transitions. [2018-12-08 17:33:33,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:33:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 44908 states and 182813 transitions. [2018-12-08 17:33:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 17:33:33,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:33,813 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] [2018-12-08 17:33:33,814 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:33,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:33,814 INFO L82 PathProgramCache]: Analyzing trace with hash -295598450, now seen corresponding path program 1 times [2018-12-08 17:33:33,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:33,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:33,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:33,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:33,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:34,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:34,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-08 17:33:34,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:33:34,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:33:34,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:33:34,185 INFO L87 Difference]: Start difference. First operand 44908 states and 182813 transitions. Second operand 17 states. [2018-12-08 17:33:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:35,539 INFO L93 Difference]: Finished difference Result 55621 states and 226438 transitions. [2018-12-08 17:33:35,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 17:33:35,539 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-12-08 17:33:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:35,643 INFO L225 Difference]: With dead ends: 55621 [2018-12-08 17:33:35,643 INFO L226 Difference]: Without dead ends: 55165 [2018-12-08 17:33:35,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2018-12-08 17:33:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55165 states. [2018-12-08 17:33:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55165 to 44721. [2018-12-08 17:33:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44721 states. [2018-12-08 17:33:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44721 states to 44721 states and 182302 transitions. [2018-12-08 17:33:36,350 INFO L78 Accepts]: Start accepts. Automaton has 44721 states and 182302 transitions. Word has length 52 [2018-12-08 17:33:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:36,351 INFO L480 AbstractCegarLoop]: Abstraction has 44721 states and 182302 transitions. [2018-12-08 17:33:36,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:33:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 44721 states and 182302 transitions. [2018-12-08 17:33:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 17:33:36,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:36,381 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] [2018-12-08 17:33:36,382 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:36,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:36,382 INFO L82 PathProgramCache]: Analyzing trace with hash 809327577, now seen corresponding path program 1 times [2018-12-08 17:33:36,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:36,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:36,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:36,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:36,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-08 17:33:36,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 17:33:36,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 17:33:36,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:33:36,553 INFO L87 Difference]: Start difference. First operand 44721 states and 182302 transitions. Second operand 15 states. [2018-12-08 17:33:36,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:36,962 INFO L93 Difference]: Finished difference Result 52211 states and 210162 transitions. [2018-12-08 17:33:36,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:33:36,962 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-12-08 17:33:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:37,040 INFO L225 Difference]: With dead ends: 52211 [2018-12-08 17:33:37,040 INFO L226 Difference]: Without dead ends: 43294 [2018-12-08 17:33:37,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-12-08 17:33:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43294 states. [2018-12-08 17:33:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43294 to 37956. [2018-12-08 17:33:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37956 states. [2018-12-08 17:33:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37956 states to 37956 states and 153296 transitions. [2018-12-08 17:33:37,608 INFO L78 Accepts]: Start accepts. Automaton has 37956 states and 153296 transitions. Word has length 53 [2018-12-08 17:33:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:37,608 INFO L480 AbstractCegarLoop]: Abstraction has 37956 states and 153296 transitions. [2018-12-08 17:33:37,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 17:33:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 37956 states and 153296 transitions. [2018-12-08 17:33:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 17:33:37,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:37,748 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] [2018-12-08 17:33:37,748 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:37,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1410636712, now seen corresponding path program 1 times [2018-12-08 17:33:37,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:37,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:37,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:37,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:37,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 17:33:37,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:33:37,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:33:37,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:33:37,867 INFO L87 Difference]: Start difference. First operand 37956 states and 153296 transitions. Second operand 13 states. [2018-12-08 17:33:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:38,345 INFO L93 Difference]: Finished difference Result 46513 states and 186428 transitions. [2018-12-08 17:33:38,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:33:38,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-12-08 17:33:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:38,412 INFO L225 Difference]: With dead ends: 46513 [2018-12-08 17:33:38,412 INFO L226 Difference]: Without dead ends: 38243 [2018-12-08 17:33:38,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2018-12-08 17:33:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38243 states. [2018-12-08 17:33:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38243 to 32694. [2018-12-08 17:33:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32694 states. [2018-12-08 17:33:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 131852 transitions. [2018-12-08 17:33:38,910 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 131852 transitions. Word has length 53 [2018-12-08 17:33:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:38,910 INFO L480 AbstractCegarLoop]: Abstraction has 32694 states and 131852 transitions. [2018-12-08 17:33:38,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:33:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 131852 transitions. [2018-12-08 17:33:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:33:38,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:38,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:38,933 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:38,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:38,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1437077398, now seen corresponding path program 1 times [2018-12-08 17:33:38,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:38,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:38,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:39,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:39,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 17:33:39,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 17:33:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 17:33:39,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:33:39,465 INFO L87 Difference]: Start difference. First operand 32694 states and 131852 transitions. Second operand 19 states. [2018-12-08 17:33:40,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:40,643 INFO L93 Difference]: Finished difference Result 37734 states and 151509 transitions. [2018-12-08 17:33:40,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 17:33:40,643 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-08 17:33:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:40,707 INFO L225 Difference]: With dead ends: 37734 [2018-12-08 17:33:40,707 INFO L226 Difference]: Without dead ends: 37293 [2018-12-08 17:33:40,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-12-08 17:33:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37293 states. [2018-12-08 17:33:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37293 to 34905. [2018-12-08 17:33:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34905 states. [2018-12-08 17:33:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34905 states to 34905 states and 140988 transitions. [2018-12-08 17:33:41,212 INFO L78 Accepts]: Start accepts. Automaton has 34905 states and 140988 transitions. Word has length 55 [2018-12-08 17:33:41,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:41,212 INFO L480 AbstractCegarLoop]: Abstraction has 34905 states and 140988 transitions. [2018-12-08 17:33:41,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 17:33:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 34905 states and 140988 transitions. [2018-12-08 17:33:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:33:41,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:41,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:41,239 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:41,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:41,239 INFO L82 PathProgramCache]: Analyzing trace with hash -51175185, now seen corresponding path program 1 times [2018-12-08 17:33:41,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:41,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:41,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:41,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:41,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:41,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:41,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 17:33:41,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 17:33:41,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 17:33:41,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:33:41,620 INFO L87 Difference]: Start difference. First operand 34905 states and 140988 transitions. Second operand 19 states. [2018-12-08 17:33:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:42,493 INFO L93 Difference]: Finished difference Result 38941 states and 156506 transitions. [2018-12-08 17:33:42,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 17:33:42,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-08 17:33:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:42,560 INFO L225 Difference]: With dead ends: 38941 [2018-12-08 17:33:42,560 INFO L226 Difference]: Without dead ends: 38614 [2018-12-08 17:33:42,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2018-12-08 17:33:42,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38614 states. [2018-12-08 17:33:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38614 to 34635. [2018-12-08 17:33:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2018-12-08 17:33:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 139908 transitions. [2018-12-08 17:33:43,092 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 139908 transitions. Word has length 55 [2018-12-08 17:33:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:43,092 INFO L480 AbstractCegarLoop]: Abstraction has 34635 states and 139908 transitions. [2018-12-08 17:33:43,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 17:33:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 139908 transitions. [2018-12-08 17:33:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:33:43,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:43,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:43,123 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:43,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:43,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1740514353, now seen corresponding path program 2 times [2018-12-08 17:33:43,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:43,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:43,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:43,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:43,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:43,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:43,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 17:33:43,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 17:33:43,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 17:33:43,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:33:43,684 INFO L87 Difference]: Start difference. First operand 34635 states and 139908 transitions. Second operand 19 states. [2018-12-08 17:33:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:45,190 INFO L93 Difference]: Finished difference Result 39529 states and 158826 transitions. [2018-12-08 17:33:45,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 17:33:45,190 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-08 17:33:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:45,256 INFO L225 Difference]: With dead ends: 39529 [2018-12-08 17:33:45,256 INFO L226 Difference]: Without dead ends: 39082 [2018-12-08 17:33:45,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2018-12-08 17:33:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39082 states. [2018-12-08 17:33:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39082 to 34575. [2018-12-08 17:33:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34575 states. [2018-12-08 17:33:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34575 states to 34575 states and 139640 transitions. [2018-12-08 17:33:45,772 INFO L78 Accepts]: Start accepts. Automaton has 34575 states and 139640 transitions. Word has length 55 [2018-12-08 17:33:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:45,772 INFO L480 AbstractCegarLoop]: Abstraction has 34575 states and 139640 transitions. [2018-12-08 17:33:45,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 17:33:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 34575 states and 139640 transitions. [2018-12-08 17:33:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:33:45,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:45,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:45,797 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:45,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1094168167, now seen corresponding path program 3 times [2018-12-08 17:33:45,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:45,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:45,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:45,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:45,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:46,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:46,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-08 17:33:46,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:33:46,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:33:46,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:33:46,086 INFO L87 Difference]: Start difference. First operand 34575 states and 139640 transitions. Second operand 17 states. [2018-12-08 17:33:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:46,841 INFO L93 Difference]: Finished difference Result 39179 states and 157389 transitions. [2018-12-08 17:33:46,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 17:33:46,841 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-12-08 17:33:46,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:46,908 INFO L225 Difference]: With dead ends: 39179 [2018-12-08 17:33:46,908 INFO L226 Difference]: Without dead ends: 38714 [2018-12-08 17:33:46,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-12-08 17:33:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38714 states. [2018-12-08 17:33:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38714 to 34551. [2018-12-08 17:33:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34551 states. [2018-12-08 17:33:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34551 states to 34551 states and 139552 transitions. [2018-12-08 17:33:47,417 INFO L78 Accepts]: Start accepts. Automaton has 34551 states and 139552 transitions. Word has length 55 [2018-12-08 17:33:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:47,417 INFO L480 AbstractCegarLoop]: Abstraction has 34551 states and 139552 transitions. [2018-12-08 17:33:47,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:33:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 34551 states and 139552 transitions. [2018-12-08 17:33:47,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:33:47,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:47,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:47,443 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:47,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:47,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1874792967, now seen corresponding path program 4 times [2018-12-08 17:33:47,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:47,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:47,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:47,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:47,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:47,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:47,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-08 17:33:47,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:33:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:33:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:33:47,734 INFO L87 Difference]: Start difference. First operand 34551 states and 139552 transitions. Second operand 17 states. [2018-12-08 17:33:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:48,675 INFO L93 Difference]: Finished difference Result 41153 states and 164986 transitions. [2018-12-08 17:33:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 17:33:48,676 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-12-08 17:33:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:48,742 INFO L225 Difference]: With dead ends: 41153 [2018-12-08 17:33:48,742 INFO L226 Difference]: Without dead ends: 40688 [2018-12-08 17:33:48,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=872, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 17:33:48,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40688 states. [2018-12-08 17:33:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40688 to 32997. [2018-12-08 17:33:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32997 states. [2018-12-08 17:33:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32997 states to 32997 states and 133345 transitions. [2018-12-08 17:33:49,251 INFO L78 Accepts]: Start accepts. Automaton has 32997 states and 133345 transitions. Word has length 55 [2018-12-08 17:33:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:49,252 INFO L480 AbstractCegarLoop]: Abstraction has 32997 states and 133345 transitions. [2018-12-08 17:33:49,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:33:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32997 states and 133345 transitions. [2018-12-08 17:33:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:33:49,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:49,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:49,275 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:49,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:49,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2007864715, now seen corresponding path program 1 times [2018-12-08 17:33:49,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:49,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:49,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:49,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:49,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:49,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:49,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-08 17:33:49,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 17:33:49,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 17:33:49,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:33:49,766 INFO L87 Difference]: Start difference. First operand 32997 states and 133345 transitions. Second operand 18 states. [2018-12-08 17:33:50,368 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2018-12-08 17:33:50,597 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2018-12-08 17:33:50,728 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-12-08 17:33:50,880 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2018-12-08 17:33:51,015 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-12-08 17:33:51,176 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2018-12-08 17:33:51,326 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2018-12-08 17:33:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:51,643 INFO L93 Difference]: Finished difference Result 32175 states and 127243 transitions. [2018-12-08 17:33:51,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 17:33:51,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-12-08 17:33:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:51,693 INFO L225 Difference]: With dead ends: 32175 [2018-12-08 17:33:51,693 INFO L226 Difference]: Without dead ends: 31245 [2018-12-08 17:33:51,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2018-12-08 17:33:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31245 states. [2018-12-08 17:33:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31245 to 24269. [2018-12-08 17:33:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24269 states. [2018-12-08 17:33:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24269 states to 24269 states and 95867 transitions. [2018-12-08 17:33:52,061 INFO L78 Accepts]: Start accepts. Automaton has 24269 states and 95867 transitions. Word has length 55 [2018-12-08 17:33:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:52,061 INFO L480 AbstractCegarLoop]: Abstraction has 24269 states and 95867 transitions. [2018-12-08 17:33:52,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 17:33:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 24269 states and 95867 transitions. [2018-12-08 17:33:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:33:52,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:52,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:52,079 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:52,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:52,079 INFO L82 PathProgramCache]: Analyzing trace with hash -406541239, now seen corresponding path program 1 times [2018-12-08 17:33:52,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:52,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:52,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:52,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:52,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:52,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:52,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 17:33:52,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 17:33:52,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 17:33:52,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:33:52,440 INFO L87 Difference]: Start difference. First operand 24269 states and 95867 transitions. Second operand 19 states. [2018-12-08 17:33:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:53,188 INFO L93 Difference]: Finished difference Result 27222 states and 106645 transitions. [2018-12-08 17:33:53,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 17:33:53,188 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-08 17:33:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:53,230 INFO L225 Difference]: With dead ends: 27222 [2018-12-08 17:33:53,230 INFO L226 Difference]: Without dead ends: 26325 [2018-12-08 17:33:53,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-12-08 17:33:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26325 states. [2018-12-08 17:33:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26325 to 25025. [2018-12-08 17:33:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25025 states. [2018-12-08 17:33:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25025 states to 25025 states and 98727 transitions. [2018-12-08 17:33:53,587 INFO L78 Accepts]: Start accepts. Automaton has 25025 states and 98727 transitions. Word has length 55 [2018-12-08 17:33:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:53,587 INFO L480 AbstractCegarLoop]: Abstraction has 25025 states and 98727 transitions. [2018-12-08 17:33:53,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 17:33:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 25025 states and 98727 transitions. [2018-12-08 17:33:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:33:53,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:53,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:53,606 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:53,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:53,606 INFO L82 PathProgramCache]: Analyzing trace with hash -513722103, now seen corresponding path program 2 times [2018-12-08 17:33:53,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:53,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:53,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:53,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:53,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:53,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:53,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 17:33:53,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 17:33:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 17:33:53,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:33:53,835 INFO L87 Difference]: Start difference. First operand 25025 states and 98727 transitions. Second operand 16 states. [2018-12-08 17:33:54,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:54,253 INFO L93 Difference]: Finished difference Result 30553 states and 119704 transitions. [2018-12-08 17:33:54,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:33:54,253 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-12-08 17:33:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:54,301 INFO L225 Difference]: With dead ends: 30553 [2018-12-08 17:33:54,301 INFO L226 Difference]: Without dead ends: 29656 [2018-12-08 17:33:54,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2018-12-08 17:33:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29656 states. [2018-12-08 17:33:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29656 to 25173. [2018-12-08 17:33:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25173 states. [2018-12-08 17:33:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25173 states to 25173 states and 99424 transitions. [2018-12-08 17:33:54,675 INFO L78 Accepts]: Start accepts. Automaton has 25173 states and 99424 transitions. Word has length 55 [2018-12-08 17:33:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:54,675 INFO L480 AbstractCegarLoop]: Abstraction has 25173 states and 99424 transitions. [2018-12-08 17:33:54,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 17:33:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 25173 states and 99424 transitions. [2018-12-08 17:33:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:33:54,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:54,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:54,693 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:54,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:54,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1096960816, now seen corresponding path program 2 times [2018-12-08 17:33:54,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:54,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:54,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:54,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:54,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:54,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:33:54,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:33:54,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:33:54,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:33:54,758 INFO L87 Difference]: Start difference. First operand 25173 states and 99424 transitions. Second operand 10 states. [2018-12-08 17:33:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:55,051 INFO L93 Difference]: Finished difference Result 28345 states and 110953 transitions. [2018-12-08 17:33:55,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:33:55,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-08 17:33:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:55,095 INFO L225 Difference]: With dead ends: 28345 [2018-12-08 17:33:55,095 INFO L226 Difference]: Without dead ends: 27421 [2018-12-08 17:33:55,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:33:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27421 states. [2018-12-08 17:33:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27421 to 23789. [2018-12-08 17:33:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23789 states. [2018-12-08 17:33:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23789 states to 23789 states and 94227 transitions. [2018-12-08 17:33:55,427 INFO L78 Accepts]: Start accepts. Automaton has 23789 states and 94227 transitions. Word has length 55 [2018-12-08 17:33:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:55,428 INFO L480 AbstractCegarLoop]: Abstraction has 23789 states and 94227 transitions. [2018-12-08 17:33:55,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:33:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 23789 states and 94227 transitions. [2018-12-08 17:33:55,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 17:33:55,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:55,445 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] [2018-12-08 17:33:55,445 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:55,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:55,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1617968395, now seen corresponding path program 1 times [2018-12-08 17:33:55,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:55,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:55,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:55,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:55,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:56,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:56,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 17:33:56,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 17:33:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 17:33:56,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-12-08 17:33:56,055 INFO L87 Difference]: Start difference. First operand 23789 states and 94227 transitions. Second operand 21 states. [2018-12-08 17:33:56,852 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2018-12-08 17:33:57,322 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2018-12-08 17:33:57,644 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2018-12-08 17:33:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:58,257 INFO L93 Difference]: Finished difference Result 21753 states and 85053 transitions. [2018-12-08 17:33:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 17:33:58,257 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-12-08 17:33:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:33:58,291 INFO L225 Difference]: With dead ends: 21753 [2018-12-08 17:33:58,291 INFO L226 Difference]: Without dead ends: 20493 [2018-12-08 17:33:58,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-12-08 17:33:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20493 states. [2018-12-08 17:33:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20493 to 17871. [2018-12-08 17:33:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17871 states. [2018-12-08 17:33:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17871 states to 17871 states and 69982 transitions. [2018-12-08 17:33:58,543 INFO L78 Accepts]: Start accepts. Automaton has 17871 states and 69982 transitions. Word has length 57 [2018-12-08 17:33:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:33:58,543 INFO L480 AbstractCegarLoop]: Abstraction has 17871 states and 69982 transitions. [2018-12-08 17:33:58,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 17:33:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 17871 states and 69982 transitions. [2018-12-08 17:33:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 17:33:58,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:33:58,557 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] [2018-12-08 17:33:58,557 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:33:58,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1231209688, now seen corresponding path program 1 times [2018-12-08 17:33:58,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:58,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:58,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:58,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:58,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:59,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:59,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 17:33:59,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 17:33:59,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 17:33:59,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:33:59,008 INFO L87 Difference]: Start difference. First operand 17871 states and 69982 transitions. Second operand 19 states. [2018-12-08 17:33:59,882 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 59 [2018-12-08 17:34:00,225 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-12-08 17:34:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:34:00,520 INFO L93 Difference]: Finished difference Result 25528 states and 98380 transitions. [2018-12-08 17:34:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 17:34:00,520 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-12-08 17:34:00,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:34:00,554 INFO L225 Difference]: With dead ends: 25528 [2018-12-08 17:34:00,554 INFO L226 Difference]: Without dead ends: 22783 [2018-12-08 17:34:00,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 17:34:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22783 states. [2018-12-08 17:34:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22783 to 13889. [2018-12-08 17:34:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13889 states. [2018-12-08 17:34:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13889 states to 13889 states and 53786 transitions. [2018-12-08 17:34:00,784 INFO L78 Accepts]: Start accepts. Automaton has 13889 states and 53786 transitions. Word has length 57 [2018-12-08 17:34:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:34:00,784 INFO L480 AbstractCegarLoop]: Abstraction has 13889 states and 53786 transitions. [2018-12-08 17:34:00,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 17:34:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 13889 states and 53786 transitions. [2018-12-08 17:34:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:34:00,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:34:00,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:34:00,796 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:34:00,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:34:00,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1637424555, now seen corresponding path program 1 times [2018-12-08 17:34:00,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:34:00,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:34:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:00,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:34:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:34:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:34:01,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:34:01,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 17:34:01,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 17:34:01,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 17:34:01,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:34:01,133 INFO L87 Difference]: Start difference. First operand 13889 states and 53786 transitions. Second operand 19 states. [2018-12-08 17:34:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:34:01,797 INFO L93 Difference]: Finished difference Result 18233 states and 70178 transitions. [2018-12-08 17:34:01,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 17:34:01,797 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-12-08 17:34:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:34:01,817 INFO L225 Difference]: With dead ends: 18233 [2018-12-08 17:34:01,817 INFO L226 Difference]: Without dead ends: 14273 [2018-12-08 17:34:01,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-12-08 17:34:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2018-12-08 17:34:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 11633. [2018-12-08 17:34:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2018-12-08 17:34:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 43674 transitions. [2018-12-08 17:34:01,970 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 43674 transitions. Word has length 58 [2018-12-08 17:34:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:34:01,970 INFO L480 AbstractCegarLoop]: Abstraction has 11633 states and 43674 transitions. [2018-12-08 17:34:01,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 17:34:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 43674 transitions. [2018-12-08 17:34:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:34:01,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:34:01,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:34:01,980 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:34:01,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:34:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1019541803, now seen corresponding path program 2 times [2018-12-08 17:34:01,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:34:01,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:34:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:01,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:34:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:34:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:34:02,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:34:02,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 17:34:02,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 17:34:02,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 17:34:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:34:02,489 INFO L87 Difference]: Start difference. First operand 11633 states and 43674 transitions. Second operand 16 states. [2018-12-08 17:34:03,163 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-12-08 17:34:03,297 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-12-08 17:34:03,905 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2018-12-08 17:34:04,221 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-12-08 17:34:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:34:04,345 INFO L93 Difference]: Finished difference Result 10553 states and 38610 transitions. [2018-12-08 17:34:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 17:34:04,346 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-12-08 17:34:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:34:04,357 INFO L225 Difference]: With dead ends: 10553 [2018-12-08 17:34:04,357 INFO L226 Difference]: Without dead ends: 9063 [2018-12-08 17:34:04,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2018-12-08 17:34:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9063 states. [2018-12-08 17:34:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9063 to 9063. [2018-12-08 17:34:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-12-08 17:34:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 33711 transitions. [2018-12-08 17:34:04,457 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 33711 transitions. Word has length 58 [2018-12-08 17:34:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:34:04,457 INFO L480 AbstractCegarLoop]: Abstraction has 9063 states and 33711 transitions. [2018-12-08 17:34:04,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 17:34:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 33711 transitions. [2018-12-08 17:34:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:34:04,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:34:04,465 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] [2018-12-08 17:34:04,465 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:34:04,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:34:04,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1171302596, now seen corresponding path program 1 times [2018-12-08 17:34:04,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:34:04,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:34:04,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:04,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:34:04,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:34:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:34:05,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:34:05,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 17:34:05,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 17:34:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 17:34:05,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-12-08 17:34:05,109 INFO L87 Difference]: Start difference. First operand 9063 states and 33711 transitions. Second operand 21 states. [2018-12-08 17:34:05,949 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-12-08 17:34:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:34:06,875 INFO L93 Difference]: Finished difference Result 10116 states and 37492 transitions. [2018-12-08 17:34:06,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:34:06,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-12-08 17:34:06,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:34:06,902 INFO L225 Difference]: With dead ends: 10116 [2018-12-08 17:34:06,902 INFO L226 Difference]: Without dead ends: 8685 [2018-12-08 17:34:06,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2018-12-08 17:34:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8685 states. [2018-12-08 17:34:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8685 to 8109. [2018-12-08 17:34:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2018-12-08 17:34:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 29535 transitions. [2018-12-08 17:34:06,997 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 29535 transitions. Word has length 60 [2018-12-08 17:34:06,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:34:06,997 INFO L480 AbstractCegarLoop]: Abstraction has 8109 states and 29535 transitions. [2018-12-08 17:34:06,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 17:34:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 29535 transitions. [2018-12-08 17:34:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:34:07,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:34:07,004 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] [2018-12-08 17:34:07,004 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:34:07,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:34:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1909123070, now seen corresponding path program 2 times [2018-12-08 17:34:07,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:34:07,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:34:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:07,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:34:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:34:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:34:07,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:34:07,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 17:34:07,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-08 17:34:07,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 17:34:07,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:34:07,574 INFO L87 Difference]: Start difference. First operand 8109 states and 29535 transitions. Second operand 20 states. [2018-12-08 17:34:08,068 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2018-12-08 17:34:08,428 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-12-08 17:34:08,689 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2018-12-08 17:34:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:34:09,007 INFO L93 Difference]: Finished difference Result 9270 states and 33722 transitions. [2018-12-08 17:34:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:34:09,007 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-08 17:34:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:34:09,018 INFO L225 Difference]: With dead ends: 9270 [2018-12-08 17:34:09,018 INFO L226 Difference]: Without dead ends: 8793 [2018-12-08 17:34:09,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-12-08 17:34:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2018-12-08 17:34:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 7893. [2018-12-08 17:34:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2018-12-08 17:34:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 28711 transitions. [2018-12-08 17:34:09,108 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 28711 transitions. Word has length 60 [2018-12-08 17:34:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:34:09,109 INFO L480 AbstractCegarLoop]: Abstraction has 7893 states and 28711 transitions. [2018-12-08 17:34:09,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-08 17:34:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 28711 transitions. [2018-12-08 17:34:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:34:09,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:34:09,115 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] [2018-12-08 17:34:09,115 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:34:09,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:34:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2058615640, now seen corresponding path program 1 times [2018-12-08 17:34:09,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:34:09,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:34:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:09,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:34:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:34:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:34:09,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:34:09,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 17:34:09,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-08 17:34:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 17:34:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:34:09,577 INFO L87 Difference]: Start difference. First operand 7893 states and 28711 transitions. Second operand 20 states. [2018-12-08 17:34:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:34:09,915 INFO L93 Difference]: Finished difference Result 8949 states and 32183 transitions. [2018-12-08 17:34:09,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:34:09,916 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-08 17:34:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:34:09,927 INFO L225 Difference]: With dead ends: 8949 [2018-12-08 17:34:09,927 INFO L226 Difference]: Without dead ends: 7509 [2018-12-08 17:34:09,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-12-08 17:34:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7509 states. [2018-12-08 17:34:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7509 to 7509. [2018-12-08 17:34:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7509 states. [2018-12-08 17:34:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7509 states to 7509 states and 27191 transitions. [2018-12-08 17:34:10,008 INFO L78 Accepts]: Start accepts. Automaton has 7509 states and 27191 transitions. Word has length 60 [2018-12-08 17:34:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:34:10,009 INFO L480 AbstractCegarLoop]: Abstraction has 7509 states and 27191 transitions. [2018-12-08 17:34:10,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-08 17:34:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 7509 states and 27191 transitions. [2018-12-08 17:34:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:34:10,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:34:10,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:34:10,014 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:34:10,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:34:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash -726446296, now seen corresponding path program 2 times [2018-12-08 17:34:10,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:34:10,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:34:10,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:10,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:34:10,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:34:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:34:10,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:34:10,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 17:34:10,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-08 17:34:10,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 17:34:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:34:10,512 INFO L87 Difference]: Start difference. First operand 7509 states and 27191 transitions. Second operand 20 states. [2018-12-08 17:34:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:34:10,792 INFO L93 Difference]: Finished difference Result 4917 states and 17063 transitions. [2018-12-08 17:34:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:34:10,792 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-08 17:34:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:34:10,797 INFO L225 Difference]: With dead ends: 4917 [2018-12-08 17:34:10,797 INFO L226 Difference]: Without dead ends: 3597 [2018-12-08 17:34:10,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-12-08 17:34:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2018-12-08 17:34:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3597. [2018-12-08 17:34:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-12-08 17:34:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 12663 transitions. [2018-12-08 17:34:10,830 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 12663 transitions. Word has length 60 [2018-12-08 17:34:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:34:10,830 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 12663 transitions. [2018-12-08 17:34:10,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-08 17:34:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 12663 transitions. [2018-12-08 17:34:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:34:10,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:34:10,832 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] [2018-12-08 17:34:10,833 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:34:10,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:34:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -894531326, now seen corresponding path program 3 times [2018-12-08 17:34:10,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:34:10,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:34:10,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:10,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:34:10,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:34:11,194 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2018-12-08 17:34:11,363 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2018-12-08 17:34:11,515 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2018-12-08 17:34:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:34:12,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:34:12,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 17:34:12,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 17:34:12,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 17:34:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:34:12,018 INFO L87 Difference]: Start difference. First operand 3597 states and 12663 transitions. Second operand 19 states. [2018-12-08 17:34:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:34:12,343 INFO L93 Difference]: Finished difference Result 4296 states and 14936 transitions. [2018-12-08 17:34:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:34:12,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-12-08 17:34:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:34:12,347 INFO L225 Difference]: With dead ends: 4296 [2018-12-08 17:34:12,347 INFO L226 Difference]: Without dead ends: 3549 [2018-12-08 17:34:12,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-12-08 17:34:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2018-12-08 17:34:12,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3549. [2018-12-08 17:34:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-12-08 17:34:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 12499 transitions. [2018-12-08 17:34:12,381 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 12499 transitions. Word has length 60 [2018-12-08 17:34:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:34:12,381 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 12499 transitions. [2018-12-08 17:34:12,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 17:34:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 12499 transitions. [2018-12-08 17:34:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:34:12,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:34:12,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:34:12,383 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:34:12,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:34:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash 314196332, now seen corresponding path program 4 times [2018-12-08 17:34:12,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:34:12,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:34:12,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:12,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:34:12,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:34:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:34:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:34:12,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:34:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 17:34:12,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 17:34:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 17:34:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:34:12,847 INFO L87 Difference]: Start difference. First operand 3549 states and 12499 transitions. Second operand 19 states. [2018-12-08 17:34:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:34:13,096 INFO L93 Difference]: Finished difference Result 882 states and 2688 transitions. [2018-12-08 17:34:13,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:34:13,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-12-08 17:34:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:34:13,096 INFO L225 Difference]: With dead ends: 882 [2018-12-08 17:34:13,097 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 17:34:13,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-12-08 17:34:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 17:34:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 17:34:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 17:34:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 17:34:13,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-12-08 17:34:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:34:13,097 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:34:13,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 17:34:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 17:34:13,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 17:34:13,099 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 17:34:13,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:34:13 BasicIcfg [2018-12-08 17:34:13,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:34:13,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:34:13,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:34:13,100 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:34:13,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:33:11" (3/4) ... [2018-12-08 17:34:13,103 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 17:34:13,107 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread0 [2018-12-08 17:34:13,107 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2018-12-08 17:34:13,107 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2018-12-08 17:34:13,107 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2018-12-08 17:34:13,109 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-08 17:34:13,109 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 17:34:13,130 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_59608c5b-e81e-4930-8a5b-60467313f7bd/bin-2019/uautomizer/witness.graphml [2018-12-08 17:34:13,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:34:13,131 INFO L168 Benchmark]: Toolchain (without parser) took 62145.00 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 951.7 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-08 17:34:13,131 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:34:13,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:34:13,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:34:13,132 INFO L168 Benchmark]: Boogie Preprocessor took 15.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:34:13,132 INFO L168 Benchmark]: RCFGBuilder took 229.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-08 17:34:13,132 INFO L168 Benchmark]: TraceAbstraction took 61447.28 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-08 17:34:13,132 INFO L168 Benchmark]: Witness Printer took 29.89 ms. Allocated memory is still 5.4 GB. Free memory is still 3.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:34:13,133 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 229.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61447.28 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 29.89 ms. Allocated memory is still 5.4 GB. Free memory is still 3.1 GB. There was no memory consumed. 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, 61.2s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 30.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6305 SDtfs, 17562 SDslu, 37142 SDs, 0 SdLazy, 15239 SolverSat, 2312 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 899 GetRequests, 99 SyntacticMatches, 42 SemanticMatches, 758 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3208 ImplicationChecksByTransitivity, 22.6s 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: 16.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 177045 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 1733 NumberOfCodeBlocks, 1733 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1700 ConstructedInterpolants, 0 QuantifiedInterpolants, 1552578 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...