./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 19:38:57,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:38:57,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:38:57,324 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:38:57,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:38:57,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:38:57,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:38:57,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:38:57,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:38:57,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:38:57,338 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:38:57,339 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:38:57,340 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:38:57,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:38:57,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:38:57,351 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:38:57,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:38:57,358 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:38:57,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:38:57,366 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:38:57,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:38:57,371 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:38:57,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:38:57,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:38:57,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:38:57,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:38:57,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:38:57,381 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:38:57,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:38:57,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:38:57,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:38:57,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:38:57,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:38:57,388 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:38:57,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:38:57,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:38:57,390 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 19:38:57,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:38:57,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:38:57,411 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:38:57,411 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:38:57,411 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:38:57,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:38:57,412 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:38:57,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:38:57,412 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:38:57,412 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:38:57,412 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:38:57,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:38:57,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:38:57,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:38:57,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:38:57,414 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:38:57,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:38:57,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:38:57,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:38:57,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:38:57,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:38:57,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:38:57,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:38:57,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:38:57,417 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:38:57,417 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:38:57,418 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:38:57,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:38:57,418 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f [2018-12-30 19:38:57,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:38:57,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:38:57,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:38:57,496 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:38:57,497 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:38:57,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-12-30 19:38:57,565 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a945f23/d2bddd85ee9545d9b8e76087c19e3550/FLAG766b0e40a [2018-12-30 19:38:58,137 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:38:58,139 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-12-30 19:38:58,153 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a945f23/d2bddd85ee9545d9b8e76087c19e3550/FLAG766b0e40a [2018-12-30 19:38:58,351 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a945f23/d2bddd85ee9545d9b8e76087c19e3550 [2018-12-30 19:38:58,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:38:58,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:38:58,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:38:58,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:38:58,364 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:38:58,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:38:58" (1/1) ... [2018-12-30 19:38:58,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bbc90c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:58, skipping insertion in model container [2018-12-30 19:38:58,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:38:58" (1/1) ... [2018-12-30 19:38:58,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:38:58,442 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:38:58,951 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:38:58,957 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:38:59,078 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:38:59,101 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:38:59,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59 WrapperNode [2018-12-30 19:38:59,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:38:59,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:38:59,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:38:59,103 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:38:59,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (1/1) ... [2018-12-30 19:38:59,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (1/1) ... [2018-12-30 19:38:59,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:38:59,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:38:59,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:38:59,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:38:59,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (1/1) ... [2018-12-30 19:38:59,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (1/1) ... [2018-12-30 19:38:59,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (1/1) ... [2018-12-30 19:38:59,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (1/1) ... [2018-12-30 19:38:59,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (1/1) ... [2018-12-30 19:38:59,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (1/1) ... [2018-12-30 19:38:59,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (1/1) ... [2018-12-30 19:38:59,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:38:59,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:38:59,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:38:59,384 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:38:59,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:38:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:38:59,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:39:02,938 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:39:02,939 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:39:02,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:39:02 BoogieIcfgContainer [2018-12-30 19:39:02,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:39:02,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:39:02,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:39:02,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:39:02,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:38:58" (1/3) ... [2018-12-30 19:39:02,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b570ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:39:02, skipping insertion in model container [2018-12-30 19:39:02,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:38:59" (2/3) ... [2018-12-30 19:39:02,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b570ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:39:02, skipping insertion in model container [2018-12-30 19:39:02,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:39:02" (3/3) ... [2018-12-30 19:39:02,949 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label05_true-unreach-call_false-termination.c [2018-12-30 19:39:02,961 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:39:02,974 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:39:02,994 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:39:03,039 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:39:03,040 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:39:03,040 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:39:03,040 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:39:03,040 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:39:03,041 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:39:03,041 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:39:03,041 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:39:03,041 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:39:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:39:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-30 19:39:03,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:39:03,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:39:03,083 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:39:03,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:39:03,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1877985287, now seen corresponding path program 1 times [2018-12-30 19:39:03,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:39:03,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:39:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:03,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:03,810 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-30 19:39:03,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:39:03,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:39:03,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:39:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:39:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:39:03,844 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2018-12-30 19:39:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:39:06,531 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2018-12-30 19:39:06,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:39:06,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-30 19:39:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:39:06,554 INFO L225 Difference]: With dead ends: 662 [2018-12-30 19:39:06,554 INFO L226 Difference]: Without dead ends: 397 [2018-12-30 19:39:06,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:39:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-12-30 19:39:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2018-12-30 19:39:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-30 19:39:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2018-12-30 19:39:06,702 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 94 [2018-12-30 19:39:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:39:06,705 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2018-12-30 19:39:06,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:39:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2018-12-30 19:39:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-30 19:39:06,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:39:06,715 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 19:39:06,716 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:39:06,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:39:06,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1993122394, now seen corresponding path program 1 times [2018-12-30 19:39:06,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:39:06,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:39:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:06,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:06,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:39:06,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:39:06,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:39:06,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:39:06,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:39:06,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:39:06,938 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2018-12-30 19:39:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:39:08,487 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2018-12-30 19:39:08,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:39:08,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-30 19:39:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:39:08,504 INFO L225 Difference]: With dead ends: 1054 [2018-12-30 19:39:08,504 INFO L226 Difference]: Without dead ends: 790 [2018-12-30 19:39:08,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:39:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-30 19:39:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-30 19:39:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-30 19:39:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2018-12-30 19:39:08,559 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 100 [2018-12-30 19:39:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:39:08,559 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2018-12-30 19:39:08,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:39:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2018-12-30 19:39:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-30 19:39:08,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:39:08,569 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 19:39:08,569 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:39:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:39:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2028903770, now seen corresponding path program 1 times [2018-12-30 19:39:08,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:39:08,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:39:08,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:08,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:08,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-30 19:39:08,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:39:08,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:39:08,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:39:08,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:39:08,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:08,764 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2018-12-30 19:39:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:39:10,295 INFO L93 Difference]: Finished difference Result 2102 states and 2831 transitions. [2018-12-30 19:39:10,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:39:10,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-30 19:39:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:39:10,309 INFO L225 Difference]: With dead ends: 2102 [2018-12-30 19:39:10,310 INFO L226 Difference]: Without dead ends: 1314 [2018-12-30 19:39:10,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-12-30 19:39:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2018-12-30 19:39:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-12-30 19:39:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1328 transitions. [2018-12-30 19:39:10,353 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1328 transitions. Word has length 101 [2018-12-30 19:39:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:39:10,353 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1328 transitions. [2018-12-30 19:39:10,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:39:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1328 transitions. [2018-12-30 19:39:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-30 19:39:10,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:39:10,369 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 19:39:10,369 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:39:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:39:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1582856459, now seen corresponding path program 1 times [2018-12-30 19:39:10,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:39:10,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:39:10,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:10,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-30 19:39:10,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:39:10,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:39:10,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:39:10,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:39:10,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:10,525 INFO L87 Difference]: Start difference. First operand 1052 states and 1328 transitions. Second operand 3 states. [2018-12-30 19:39:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:39:12,052 INFO L93 Difference]: Finished difference Result 2364 states and 3019 transitions. [2018-12-30 19:39:12,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:39:12,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-12-30 19:39:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:39:12,061 INFO L225 Difference]: With dead ends: 2364 [2018-12-30 19:39:12,061 INFO L226 Difference]: Without dead ends: 1314 [2018-12-30 19:39:12,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-12-30 19:39:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2018-12-30 19:39:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-12-30 19:39:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1502 transitions. [2018-12-30 19:39:12,100 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1502 transitions. Word has length 128 [2018-12-30 19:39:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:39:12,101 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1502 transitions. [2018-12-30 19:39:12,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:39:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1502 transitions. [2018-12-30 19:39:12,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-30 19:39:12,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:39:12,105 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:39:12,106 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:39:12,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:39:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1986645786, now seen corresponding path program 1 times [2018-12-30 19:39:12,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:39:12,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:39:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:12,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 19:39:12,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:39:12,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:39:12,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:39:12,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:39:12,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:12,270 INFO L87 Difference]: Start difference. First operand 1183 states and 1502 transitions. Second operand 3 states. [2018-12-30 19:39:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:39:13,067 INFO L93 Difference]: Finished difference Result 3150 states and 3980 transitions. [2018-12-30 19:39:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:39:13,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-12-30 19:39:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:39:13,083 INFO L225 Difference]: With dead ends: 3150 [2018-12-30 19:39:13,084 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 19:39:13,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:13,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 19:39:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2018-12-30 19:39:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:39:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2265 transitions. [2018-12-30 19:39:13,127 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2265 transitions. Word has length 152 [2018-12-30 19:39:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:39:13,127 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2265 transitions. [2018-12-30 19:39:13,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:39:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2265 transitions. [2018-12-30 19:39:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-30 19:39:13,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:39:13,133 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 19:39:13,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:39:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:39:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash -27987931, now seen corresponding path program 1 times [2018-12-30 19:39:13,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:39:13,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:39:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:13,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-30 19:39:13,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:39:13,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:39:13,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:39:13,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:39:13,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:13,278 INFO L87 Difference]: Start difference. First operand 1838 states and 2265 transitions. Second operand 3 states. [2018-12-30 19:39:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:39:13,741 INFO L93 Difference]: Finished difference Result 3674 states and 4528 transitions. [2018-12-30 19:39:13,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:39:13,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2018-12-30 19:39:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:39:13,751 INFO L225 Difference]: With dead ends: 3674 [2018-12-30 19:39:13,751 INFO L226 Difference]: Without dead ends: 1838 [2018-12-30 19:39:13,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-30 19:39:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2018-12-30 19:39:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2018-12-30 19:39:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2110 transitions. [2018-12-30 19:39:13,792 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2110 transitions. Word has length 157 [2018-12-30 19:39:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:39:13,792 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 2110 transitions. [2018-12-30 19:39:13,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:39:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2110 transitions. [2018-12-30 19:39:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-30 19:39:13,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:39:13,798 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:39:13,798 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:39:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:39:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash 639923582, now seen corresponding path program 1 times [2018-12-30 19:39:13,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:39:13,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:39:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:13,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-30 19:39:13,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:39:13,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:39:13,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:39:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:39:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:13,905 INFO L87 Difference]: Start difference. First operand 1707 states and 2110 transitions. Second operand 3 states. [2018-12-30 19:39:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:39:14,396 INFO L93 Difference]: Finished difference Result 3543 states and 4361 transitions. [2018-12-30 19:39:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:39:14,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2018-12-30 19:39:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:39:14,405 INFO L225 Difference]: With dead ends: 3543 [2018-12-30 19:39:14,406 INFO L226 Difference]: Without dead ends: 1838 [2018-12-30 19:39:14,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-30 19:39:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2018-12-30 19:39:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:39:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2229 transitions. [2018-12-30 19:39:14,449 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2229 transitions. Word has length 177 [2018-12-30 19:39:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:39:14,449 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2229 transitions. [2018-12-30 19:39:14,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:39:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2229 transitions. [2018-12-30 19:39:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-30 19:39:14,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:39:14,455 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:39:14,455 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:39:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:39:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash 502707782, now seen corresponding path program 1 times [2018-12-30 19:39:14,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:39:14,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:39:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:14,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:14,963 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-30 19:39:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-30 19:39:15,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:39:15,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 19:39:15,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 19:39:15,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 19:39:15,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 19:39:15,113 INFO L87 Difference]: Start difference. First operand 1838 states and 2229 transitions. Second operand 8 states. [2018-12-30 19:39:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:39:16,208 INFO L93 Difference]: Finished difference Result 3844 states and 4632 transitions. [2018-12-30 19:39:16,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 19:39:16,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2018-12-30 19:39:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:39:16,218 INFO L225 Difference]: With dead ends: 3844 [2018-12-30 19:39:16,218 INFO L226 Difference]: Without dead ends: 2008 [2018-12-30 19:39:16,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 19:39:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2018-12-30 19:39:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1838. [2018-12-30 19:39:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:39:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2217 transitions. [2018-12-30 19:39:16,267 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2217 transitions. Word has length 181 [2018-12-30 19:39:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:39:16,267 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2217 transitions. [2018-12-30 19:39:16,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 19:39:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2217 transitions. [2018-12-30 19:39:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-30 19:39:16,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:39:16,276 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:39:16,276 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:39:16,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:39:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash 997281865, now seen corresponding path program 1 times [2018-12-30 19:39:16,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:39:16,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:39:16,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:16,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:16,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-30 19:39:16,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:39:16,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:39:16,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:39:16,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:39:16,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:16,499 INFO L87 Difference]: Start difference. First operand 1838 states and 2217 transitions. Second operand 3 states. [2018-12-30 19:39:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:39:16,953 INFO L93 Difference]: Finished difference Result 2364 states and 2826 transitions. [2018-12-30 19:39:16,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:39:16,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-12-30 19:39:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:39:16,964 INFO L225 Difference]: With dead ends: 2364 [2018-12-30 19:39:16,964 INFO L226 Difference]: Without dead ends: 2362 [2018-12-30 19:39:16,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:39:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2018-12-30 19:39:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2018-12-30 19:39:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2018-12-30 19:39:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2043 transitions. [2018-12-30 19:39:17,006 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2043 transitions. Word has length 198 [2018-12-30 19:39:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:39:17,008 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 2043 transitions. [2018-12-30 19:39:17,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:39:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2043 transitions. [2018-12-30 19:39:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-30 19:39:17,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:39:17,014 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 19:39:17,014 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:39:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:39:17,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1286042342, now seen corresponding path program 1 times [2018-12-30 19:39:17,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:39:17,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:39:17,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:17,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:17,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:39:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 19:39:17,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:39:17,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 19:39:17,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:39:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:39:17,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:39:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-12-30 19:39:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:39:17,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-12-30 19:39:17,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 19:39:17,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 19:39:17,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-30 19:39:17,733 INFO L87 Difference]: Start difference. First operand 1707 states and 2043 transitions. Second operand 7 states. [2018-12-30 19:39:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:39:24,881 INFO L93 Difference]: Finished difference Result 3851 states and 4626 transitions. [2018-12-30 19:39:24,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 19:39:24,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2018-12-30 19:39:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:39:24,882 INFO L225 Difference]: With dead ends: 3851 [2018-12-30 19:39:24,882 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:39:24,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-12-30 19:39:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:39:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:39:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:39:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:39:24,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2018-12-30 19:39:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:39:24,894 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:39:24,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 19:39:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:39:24,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:39:24,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:39:24,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,044 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 71 [2018-12-30 19:39:25,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:25,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:39:26,298 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2018-12-30 19:39:26,992 WARN L181 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2018-12-30 19:39:26,995 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:39:26,995 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:39:26,995 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:39:26,996 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:39:26,997 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:39:26,997 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:39:26,997 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:39:26,997 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:39:26,997 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2018-12-30 19:39:26,997 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,997 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,997 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,997 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,997 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:39:26,998 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:39:26,999 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:39:27,000 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:39:27,000 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:39:27,000 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:39:27,000 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:39:27,000 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:39:27,000 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:39:27,000 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:39:27,001 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (<= ~a21~0 0)) (.cse2 (= ~a20~0 1)) (.cse6 (not (= ~a7~0 1))) (.cse5 (not (= ~a16~0 6))) (.cse4 (= ~a21~0 1)) (.cse7 (not (= ~a8~0 13))) (.cse1 (= ~a12~0 8)) (.cse3 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 (and .cse3 .cse4 .cse2)) (and .cse0 .cse5 .cse3 .cse1) (and .cse6 .cse1 .cse4 .cse2) (and .cse6 .cse1 .cse4 .cse7) (and (or (and .cse6 .cse5 .cse4) (and .cse5 .cse4 .cse7)) .cse1 (not .cse3)))) [2018-12-30 19:39:27,001 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,001 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,001 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,001 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,001 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,001 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:39:27,001 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:39:27,002 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:39:27,003 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:39:27,003 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,003 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,003 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,003 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,003 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,003 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:39:27,003 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:39:27,003 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:39:27,003 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:39:27,003 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,004 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:39:27,005 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:39:27,005 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:39:27,005 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:39:27,005 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:39:27,005 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:39:27,005 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:39:27,005 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:39:27,005 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:39:27,005 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:39:27,005 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:39:27,006 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:39:27,006 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:39:27,006 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:39:27,006 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,006 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a21~0 0)) (.cse2 (= ~a20~0 1)) (.cse6 (not (= ~a7~0 1))) (.cse5 (not (= ~a16~0 6))) (.cse4 (= ~a21~0 1)) (.cse7 (not (= ~a8~0 13))) (.cse1 (= ~a12~0 8)) (.cse3 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 (and .cse3 .cse4 .cse2)) (and .cse0 .cse5 .cse3 .cse1) (and .cse6 .cse1 .cse4 .cse2) (and .cse6 .cse1 .cse4 .cse7) (and (or (and .cse6 .cse5 .cse4) (and .cse5 .cse4 .cse7)) .cse1 (not .cse3)))) [2018-12-30 19:39:27,006 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,006 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,007 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,007 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,007 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:39:27,007 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:39:27,007 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:39:27,007 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:39:27,007 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:39:27,007 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:39:27,007 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:39:27,008 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:39:27,008 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,008 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,008 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,008 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,008 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,008 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:39:27,008 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:39:27,008 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:39:27,009 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:39:27,009 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:39:27,009 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:39:27,009 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:39:27,009 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:39:27,009 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:39:27,009 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:39:27,009 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:39:27,009 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:39:27,009 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:39:27,010 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,010 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,010 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,010 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,010 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:39:27,010 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,010 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,010 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:39:27,010 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:39:27,011 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:39:27,011 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:39:27,011 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:39:27,011 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:39:27,011 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:39:27,011 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:39:27,011 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:39:27,011 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:39:27,012 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:39:27,012 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:39:27,012 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:39:27,012 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,012 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,012 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,012 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,012 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,012 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:39:27,012 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,013 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:39:27,013 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:39:27,013 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:39:27,013 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:39:27,013 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:39:27,013 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:39:27,013 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:39:27,013 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:39:27,013 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:39:27,013 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,014 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:39:27,015 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:39:27,015 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:39:27,015 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:39:27,015 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:39:27,015 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:39:27,015 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:39:27,015 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:39:27,015 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:39:27,015 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:39:27,015 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:39:27,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:39:27 BoogieIcfgContainer [2018-12-30 19:39:27,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:39:27,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:39:27,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:39:27,037 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:39:27,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:39:02" (3/4) ... [2018-12-30 19:39:27,042 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:39:27,077 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:39:27,086 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:39:27,300 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:39:27,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:39:27,301 INFO L168 Benchmark]: Toolchain (without parser) took 28943.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 393.7 MB). Free memory was 954.1 MB in the beginning and 858.9 MB in the end (delta: 95.1 MB). Peak memory consumption was 488.9 MB. Max. memory is 11.5 GB. [2018-12-30 19:39:27,302 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 19:39:27,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.99 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 921.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:39:27,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 202.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:39:27,305 INFO L168 Benchmark]: Boogie Preprocessor took 78.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:39:27,306 INFO L168 Benchmark]: RCFGBuilder took 3556.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.9 MB). Peak memory consumption was 107.9 MB. Max. memory is 11.5 GB. [2018-12-30 19:39:27,306 INFO L168 Benchmark]: TraceAbstraction took 24094.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.8 MB). Free memory was 1.0 GB in the beginning and 870.4 MB in the end (delta: 140.3 MB). Peak memory consumption was 395.1 MB. Max. memory is 11.5 GB. [2018-12-30 19:39:27,306 INFO L168 Benchmark]: Witness Printer took 263.67 ms. Allocated memory is still 1.4 GB. Free memory was 870.4 MB in the beginning and 858.9 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2018-12-30 19:39:27,310 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 742.99 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 921.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 202.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3556.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.9 MB). Peak memory consumption was 107.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24094.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.8 MB). Free memory was 1.0 GB in the beginning and 870.4 MB in the end (delta: 140.3 MB). Peak memory consumption was 395.1 MB. Max. memory is 11.5 GB. * Witness Printer took 263.67 ms. Allocated memory is still 1.4 GB. Free memory was 870.4 MB in the beginning and 858.9 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: 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 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((a21 <= 0 && a12 == 8) && a20 == 1) || (a12 == 8 && (a17 == 1 && a21 == 1) && a20 == 1)) || (((a21 <= 0 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && !(a8 == 13))) || (((((!(a7 == 1) && !(a16 == 6)) && a21 == 1) || ((!(a16 == 6) && a21 == 1) && !(a8 == 13))) && a12 == 8) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((a21 <= 0 && a12 == 8) && a20 == 1) || (a12 == 8 && (a17 == 1 && a21 == 1) && a20 == 1)) || (((a21 <= 0 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && !(a8 == 13))) || (((((!(a7 == 1) && !(a16 == 6)) && a21 == 1) || ((!(a16 == 6) && a21 == 1) && !(a8 == 13))) && a12 == 8) && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 23.9s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 17.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 398 SDtfs, 2214 SDslu, 131 SDs, 0 SdLazy, 6509 SolverSat, 1076 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 236 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 1611 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 70 NumberOfFragments, 203 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8160 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 786 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1720 NumberOfCodeBlocks, 1720 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 712697 SizeOfPredicates, 1 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1003/1073 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...