./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label40_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label40_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 cf5fe32b34f3bdb04ccea0560b6f352942ab84d1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:56:22,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:56:22,547 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:56:22,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:56:22,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:56:22,567 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:56:22,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:56:22,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:56:22,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:56:22,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:56:22,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:56:22,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:56:22,580 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:56:22,582 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:56:22,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:56:22,590 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:56:22,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:56:22,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:56:22,602 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:56:22,603 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:56:22,604 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:56:22,606 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:56:22,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:56:22,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:56:22,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:56:22,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:56:22,612 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:56:22,613 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:56:22,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:56:22,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:56:22,615 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:56:22,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:56:22,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:56:22,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:56:22,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:56:22,620 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:56:22,620 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:56:22,636 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:56:22,636 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:56:22,637 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:56:22,638 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:56:22,638 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:56:22,638 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:56:22,638 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:56:22,638 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:56:22,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:56:22,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:56:22,639 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:56:22,639 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:56:22,639 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:56:22,639 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:56:22,639 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:56:22,640 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:56:22,640 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:56:22,640 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:56:22,640 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:56:22,640 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:56:22,640 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:56:22,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:56:22,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:56:22,641 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:56:22,641 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:56:22,641 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:56:22,641 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:56:22,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:56:22,642 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 -> cf5fe32b34f3bdb04ccea0560b6f352942ab84d1 [2019-01-12 00:56:22,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:56:22,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:56:22,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:56:22,705 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:56:22,705 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:56:22,706 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label40_true-unreach-call_false-termination.c [2019-01-12 00:56:22,767 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde590c1a/e7966f90e0f645709ee380dbfbf53356/FLAG50c2dd404 [2019-01-12 00:56:23,340 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:56:23,342 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label40_true-unreach-call_false-termination.c [2019-01-12 00:56:23,360 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde590c1a/e7966f90e0f645709ee380dbfbf53356/FLAG50c2dd404 [2019-01-12 00:56:23,554 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde590c1a/e7966f90e0f645709ee380dbfbf53356 [2019-01-12 00:56:23,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:56:23,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:56:23,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:56:23,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:56:23,566 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:56:23,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:56:23" (1/1) ... [2019-01-12 00:56:23,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9a6a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:23, skipping insertion in model container [2019-01-12 00:56:23,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:56:23" (1/1) ... [2019-01-12 00:56:23,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:56:23,635 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:56:24,139 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:56:24,146 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:56:24,319 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:56:24,342 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:56:24,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24 WrapperNode [2019-01-12 00:56:24,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:56:24,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:56:24,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:56:24,344 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:56:24,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (1/1) ... [2019-01-12 00:56:24,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (1/1) ... [2019-01-12 00:56:24,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:56:24,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:56:24,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:56:24,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:56:24,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (1/1) ... [2019-01-12 00:56:24,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (1/1) ... [2019-01-12 00:56:24,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (1/1) ... [2019-01-12 00:56:24,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (1/1) ... [2019-01-12 00:56:24,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (1/1) ... [2019-01-12 00:56:24,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (1/1) ... [2019-01-12 00:56:24,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (1/1) ... [2019-01-12 00:56:24,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:56:24,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:56:24,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:56:24,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:56:24,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:56:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:56:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:56:27,899 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:56:27,900 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:56:27,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:27 BoogieIcfgContainer [2019-01-12 00:56:27,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:56:27,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:56:27,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:56:27,907 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:56:27,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:56:23" (1/3) ... [2019-01-12 00:56:27,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b01d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:56:27, skipping insertion in model container [2019-01-12 00:56:27,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:24" (2/3) ... [2019-01-12 00:56:27,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b01d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:56:27, skipping insertion in model container [2019-01-12 00:56:27,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:27" (3/3) ... [2019-01-12 00:56:27,913 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label40_true-unreach-call_false-termination.c [2019-01-12 00:56:27,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:56:27,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:56:27,959 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:56:28,007 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:56:28,008 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:56:28,008 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:56:28,008 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:56:28,009 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:56:28,009 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:56:28,009 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:56:28,009 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:56:28,009 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:56:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:56:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-12 00:56:28,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:28,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:56:28,048 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:28,053 INFO L82 PathProgramCache]: Analyzing trace with hash 427661899, now seen corresponding path program 1 times [2019-01-12 00:56:28,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:28,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:28,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:28,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:28,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:28,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:28,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:28,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:28,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:28,640 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:56:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:31,505 INFO L93 Difference]: Finished difference Result 775 states and 1353 transitions. [2019-01-12 00:56:31,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:31,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-12 00:56:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:31,527 INFO L225 Difference]: With dead ends: 775 [2019-01-12 00:56:31,527 INFO L226 Difference]: Without dead ends: 460 [2019-01-12 00:56:31,532 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 [2019-01-12 00:56:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-01-12 00:56:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 308. [2019-01-12 00:56:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-12 00:56:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2019-01-12 00:56:31,620 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 89 [2019-01-12 00:56:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:31,623 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2019-01-12 00:56:31,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2019-01-12 00:56:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 00:56:31,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:31,629 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:56:31,630 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:31,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:31,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1584478528, now seen corresponding path program 1 times [2019-01-12 00:56:31,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:31,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:31,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:31,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:31,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:31,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:31,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:56:31,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:31,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:31,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:31,878 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand 4 states. [2019-01-12 00:56:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:33,203 INFO L93 Difference]: Finished difference Result 1180 states and 1741 transitions. [2019-01-12 00:56:33,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:33,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-12 00:56:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:33,212 INFO L225 Difference]: With dead ends: 1180 [2019-01-12 00:56:33,212 INFO L226 Difference]: Without dead ends: 874 [2019-01-12 00:56:33,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-01-12 00:56:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 870. [2019-01-12 00:56:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-01-12 00:56:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1183 transitions. [2019-01-12 00:56:33,275 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1183 transitions. Word has length 93 [2019-01-12 00:56:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:33,275 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1183 transitions. [2019-01-12 00:56:33,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1183 transitions. [2019-01-12 00:56:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 00:56:33,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:33,281 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:56:33,281 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:33,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:33,282 INFO L82 PathProgramCache]: Analyzing trace with hash 606564730, now seen corresponding path program 1 times [2019-01-12 00:56:33,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:33,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:33,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:33,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:33,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 00:56:33,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:33,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:33,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:33,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:33,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:33,406 INFO L87 Difference]: Start difference. First operand 870 states and 1183 transitions. Second operand 4 states. [2019-01-12 00:56:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:35,674 INFO L93 Difference]: Finished difference Result 2146 states and 2939 transitions. [2019-01-12 00:56:35,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:35,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-01-12 00:56:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:35,682 INFO L225 Difference]: With dead ends: 2146 [2019-01-12 00:56:35,682 INFO L226 Difference]: Without dead ends: 1278 [2019-01-12 00:56:35,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-01-12 00:56:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 578. [2019-01-12 00:56:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-01-12 00:56:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 776 transitions. [2019-01-12 00:56:35,716 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 776 transitions. Word has length 99 [2019-01-12 00:56:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:35,717 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 776 transitions. [2019-01-12 00:56:35,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 776 transitions. [2019-01-12 00:56:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 00:56:35,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:35,721 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:56:35,721 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:35,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash 450798671, now seen corresponding path program 1 times [2019-01-12 00:56:35,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:35,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:35,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:35,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:35,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:56:35,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:56:35,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:56:35,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:35,832 INFO L87 Difference]: Start difference. First operand 578 states and 776 transitions. Second operand 3 states. [2019-01-12 00:56:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:36,837 INFO L93 Difference]: Finished difference Result 1714 states and 2306 transitions. [2019-01-12 00:56:36,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:56:36,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-12 00:56:36,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:36,845 INFO L225 Difference]: With dead ends: 1714 [2019-01-12 00:56:36,845 INFO L226 Difference]: Without dead ends: 1138 [2019-01-12 00:56:36,847 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 [2019-01-12 00:56:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-01-12 00:56:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2019-01-12 00:56:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-01-12 00:56:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1447 transitions. [2019-01-12 00:56:36,872 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1447 transitions. Word has length 99 [2019-01-12 00:56:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:36,873 INFO L480 AbstractCegarLoop]: Abstraction has 1138 states and 1447 transitions. [2019-01-12 00:56:36,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:56:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1447 transitions. [2019-01-12 00:56:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 00:56:36,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:36,876 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:56:36,877 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:36,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1355718265, now seen corresponding path program 1 times [2019-01-12 00:56:36,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:36,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:36,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:36,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:36,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:36,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:36,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:36,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:36,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:36,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:36,971 INFO L87 Difference]: Start difference. First operand 1138 states and 1447 transitions. Second operand 4 states. [2019-01-12 00:56:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:37,681 INFO L93 Difference]: Finished difference Result 2415 states and 3064 transitions. [2019-01-12 00:56:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:37,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-01-12 00:56:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:37,691 INFO L225 Difference]: With dead ends: 2415 [2019-01-12 00:56:37,691 INFO L226 Difference]: Without dead ends: 1279 [2019-01-12 00:56:37,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-01-12 00:56:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2019-01-12 00:56:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-01-12 00:56:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1438 transitions. [2019-01-12 00:56:37,721 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1438 transitions. Word has length 113 [2019-01-12 00:56:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:37,722 INFO L480 AbstractCegarLoop]: Abstraction has 1279 states and 1438 transitions. [2019-01-12 00:56:37,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1438 transitions. [2019-01-12 00:56:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-12 00:56:37,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:37,726 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:56:37,727 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:37,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:37,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1019939816, now seen corresponding path program 1 times [2019-01-12 00:56:37,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:37,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:37,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:37,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:37,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:56:37,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:56:37,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:38,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:56:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:38,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:56:38,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 00:56:38,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:56:38,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:56:38,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:56:38,211 INFO L87 Difference]: Start difference. First operand 1279 states and 1438 transitions. Second operand 8 states. [2019-01-12 00:56:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:43,179 INFO L93 Difference]: Finished difference Result 3721 states and 4191 transitions. [2019-01-12 00:56:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 00:56:43,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-01-12 00:56:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:43,189 INFO L225 Difference]: With dead ends: 3721 [2019-01-12 00:56:43,190 INFO L226 Difference]: Without dead ends: 2156 [2019-01-12 00:56:43,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-12 00:56:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2019-01-12 00:56:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1836. [2019-01-12 00:56:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-01-12 00:56:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2012 transitions. [2019-01-12 00:56:43,232 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2012 transitions. Word has length 122 [2019-01-12 00:56:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:43,233 INFO L480 AbstractCegarLoop]: Abstraction has 1836 states and 2012 transitions. [2019-01-12 00:56:43,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:56:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2012 transitions. [2019-01-12 00:56:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-12 00:56:43,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:43,238 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:56:43,238 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:43,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash 911939789, now seen corresponding path program 1 times [2019-01-12 00:56:43,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:43,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:43,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:43,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:43,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:56:43,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:43,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:43,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:56:43,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:56:43,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:43,319 INFO L87 Difference]: Start difference. First operand 1836 states and 2012 transitions. Second operand 3 states. [2019-01-12 00:56:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:43,876 INFO L93 Difference]: Finished difference Result 4230 states and 4667 transitions. [2019-01-12 00:56:43,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:56:43,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-01-12 00:56:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:43,886 INFO L225 Difference]: With dead ends: 4230 [2019-01-12 00:56:43,886 INFO L226 Difference]: Without dead ends: 1694 [2019-01-12 00:56:43,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2019-01-12 00:56:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1694. [2019-01-12 00:56:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2019-01-12 00:56:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 1825 transitions. [2019-01-12 00:56:43,923 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 1825 transitions. Word has length 126 [2019-01-12 00:56:43,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:43,923 INFO L480 AbstractCegarLoop]: Abstraction has 1694 states and 1825 transitions. [2019-01-12 00:56:43,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:56:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 1825 transitions. [2019-01-12 00:56:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-12 00:56:43,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:43,928 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:56:43,928 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:43,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash -863331546, now seen corresponding path program 1 times [2019-01-12 00:56:43,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:43,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:43,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:43,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:43,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 00:56:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:44,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:44,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:56:44,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:56:44,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:44,035 INFO L87 Difference]: Start difference. First operand 1694 states and 1825 transitions. Second operand 3 states. [2019-01-12 00:56:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:44,861 INFO L93 Difference]: Finished difference Result 3249 states and 3507 transitions. [2019-01-12 00:56:44,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:56:44,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-01-12 00:56:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:44,868 INFO L225 Difference]: With dead ends: 3249 [2019-01-12 00:56:44,868 INFO L226 Difference]: Without dead ends: 1697 [2019-01-12 00:56:44,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-01-12 00:56:44,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1694. [2019-01-12 00:56:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2019-01-12 00:56:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 1810 transitions. [2019-01-12 00:56:44,902 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 1810 transitions. Word has length 136 [2019-01-12 00:56:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:44,902 INFO L480 AbstractCegarLoop]: Abstraction has 1694 states and 1810 transitions. [2019-01-12 00:56:44,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:56:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 1810 transitions. [2019-01-12 00:56:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-01-12 00:56:44,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:44,908 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:56:44,908 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1758746456, now seen corresponding path program 1 times [2019-01-12 00:56:44,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:44,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 00:56:45,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:56:45,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:56:45,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:45,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:56:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-12 00:56:45,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:56:45,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-01-12 00:56:45,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 00:56:45,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 00:56:45,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-12 00:56:45,446 INFO L87 Difference]: Start difference. First operand 1694 states and 1810 transitions. Second operand 9 states. [2019-01-12 00:56:47,226 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2019-01-12 00:56:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:49,045 INFO L93 Difference]: Finished difference Result 3530 states and 3785 transitions. [2019-01-12 00:56:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 00:56:49,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2019-01-12 00:56:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:49,047 INFO L225 Difference]: With dead ends: 3530 [2019-01-12 00:56:49,047 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:56:49,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-01-12 00:56:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:56:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:56:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:56:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:56:49,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2019-01-12 00:56:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:49,054 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:56:49,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 00:56:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:56:49,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:56:49,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:56:49,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:56:49,190 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-01-12 00:56:49,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:56:50,632 WARN L181 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2019-01-12 00:56:50,921 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2019-01-12 00:56:50,924 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,924 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,924 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,925 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:56:50,925 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:56:50,925 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:56:50,925 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:56:50,925 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:56:50,925 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:56:50,926 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:56:50,926 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,926 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,926 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,926 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:56:50,926 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:56:50,926 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:56:50,927 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:56:50,928 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:56:50,928 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,928 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,928 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,928 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:56:50,928 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:56:50,928 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:56:50,928 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:56:50,928 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:56:50,929 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:56:50,929 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:56:50,929 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:56:50,929 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,929 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,929 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,929 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:56:50,929 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:56:50,929 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:56:50,929 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:56:50,930 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:56:50,930 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:56:50,930 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:56:50,930 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:56:50,931 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2019-01-12 00:56:50,931 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,931 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,931 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,931 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:56:50,931 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:56:50,931 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:56:50,931 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:56:50,931 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:56:50,931 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:56:50,932 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:56:50,933 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,934 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:56:50,935 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:56:50,936 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:56:50,936 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,936 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,936 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:56:50,936 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:56:50,936 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:56:50,936 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:56:50,936 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:56:50,936 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:56:50,937 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:56:50,937 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:56:50,937 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:56:50,937 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a28~0 7)) (.cse2 (<= ~a17~0 8))) (let ((.cse9 (and (not .cse1) .cse2)) (.cse10 (not (= ~a28~0 11))) (.cse8 (= ~a11~0 1)) (.cse3 (= ~a25~0 1))) (let ((.cse7 (not .cse3)) (.cse6 (not .cse8)) (.cse0 (= ~a19~0 1)) (.cse5 (= ~a17~0 8)) (.cse12 (= ~a21~0 1)) (.cse4 (<= ~a19~0 0)) (.cse13 (not (= ~a28~0 8))) (.cse11 (and .cse9 .cse10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and .cse4 .cse7 .cse1 .cse2 .cse8) (and .cse0 .cse9 .cse3 .cse10) (and .cse11 .cse4 .cse7) (and .cse5 .cse0 .cse1 .cse12 .cse6) (and .cse5 .cse0 .cse3 .cse6 .cse12) (and (and .cse0 .cse9 .cse10) .cse13 .cse5 .cse12) (and .cse11 .cse4 .cse13) (and .cse11 .cse8))))) [2019-01-12 00:56:50,937 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,938 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,938 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:56:50,938 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:56:50,938 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:56:50,938 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:56:50,938 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:56:50,938 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:56:50,938 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:56:50,938 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,938 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,938 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,939 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:56:50,940 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:56:50,940 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:56:50,940 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:56:50,940 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:56:50,940 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:56:50,940 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a28~0 7)) (.cse2 (<= ~a17~0 8))) (let ((.cse9 (and (not .cse1) .cse2)) (.cse10 (not (= ~a28~0 11))) (.cse8 (= ~a11~0 1)) (.cse3 (= ~a25~0 1))) (let ((.cse7 (not .cse3)) (.cse6 (not .cse8)) (.cse0 (= ~a19~0 1)) (.cse5 (= ~a17~0 8)) (.cse12 (= ~a21~0 1)) (.cse4 (<= ~a19~0 0)) (.cse13 (not (= ~a28~0 8))) (.cse11 (and .cse9 .cse10))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and .cse4 .cse7 .cse1 .cse2 .cse8) (and .cse0 .cse9 .cse3 .cse10) (and .cse11 .cse4 .cse7) (and .cse5 .cse0 .cse1 .cse12 .cse6) (and .cse5 .cse0 .cse3 .cse6 .cse12) (and (and .cse0 .cse9 .cse10) .cse13 .cse5 .cse12) (and .cse11 .cse4 .cse13) (and .cse11 .cse8))))) [2019-01-12 00:56:50,940 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,940 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,940 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:56:50,941 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:56:50,942 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:56:50,943 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,944 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:56:50,945 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,946 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,946 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,946 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:56:50,946 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:56:50,946 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:56:50,946 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:56:50,946 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:56:50,946 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,946 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,946 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:50,947 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:56:50,947 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:56:50,947 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:56:50,947 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:56:50,947 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:56:50,947 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:56:50,947 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:56:50,947 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:56:50,947 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:56:50,947 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:56:50,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:56:50 BoogieIcfgContainer [2019-01-12 00:56:50,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:56:50,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:56:50,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:56:50,972 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:56:50,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:27" (3/4) ... [2019-01-12 00:56:50,976 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:56:51,021 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:56:51,023 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:56:51,294 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:56:51,294 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:56:51,298 INFO L168 Benchmark]: Toolchain (without parser) took 27736.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 952.7 MB in the beginning and 855.6 MB in the end (delta: 97.2 MB). Peak memory consumption was 472.0 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:51,299 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:56:51,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.11 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 913.8 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:51,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 169.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -216.3 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:51,301 INFO L168 Benchmark]: Boogie Preprocessor took 68.53 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:51,301 INFO L168 Benchmark]: RCFGBuilder took 3319.83 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: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:51,301 INFO L168 Benchmark]: TraceAbstraction took 23068.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.0 GB in the beginning and 877.5 MB in the end (delta: 141.5 MB). Peak memory consumption was 373.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:51,304 INFO L168 Benchmark]: Witness Printer took 322.53 ms. Allocated memory is still 1.4 GB. Free memory was 877.5 MB in the beginning and 855.6 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:51,308 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.15 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 782.11 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 913.8 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 169.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -216.3 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.53 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3319.83 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: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23068.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.0 GB in the beginning and 877.5 MB in the end (delta: 141.5 MB). Peak memory consumption was 373.3 MB. Max. memory is 11.5 GB. * Witness Printer took 322.53 ms. Allocated memory is still 1.4 GB. Free memory was 877.5 MB in the beginning and 855.6 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((a19 == 1 && a28 == 7) && a17 <= 8) && a25 == 1) || (((a19 <= 0 && a17 == 8) && a28 == 7) && !(a11 == 1))) || ((((a19 <= 0 && !(a25 == 1)) && a28 == 7) && a17 <= 8) && a11 == 1)) || (((a19 == 1 && !(a28 == 7) && a17 <= 8) && a25 == 1) && !(a28 == 11))) || ((((!(a28 == 7) && a17 <= 8) && !(a28 == 11)) && a19 <= 0) && !(a25 == 1))) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1) && !(a11 == 1))) || ((((a17 == 8 && a19 == 1) && a25 == 1) && !(a11 == 1)) && a21 == 1)) || (((((a19 == 1 && !(a28 == 7) && a17 <= 8) && !(a28 == 11)) && !(a28 == 8)) && a17 == 8) && a21 == 1)) || ((((!(a28 == 7) && a17 <= 8) && !(a28 == 11)) && a19 <= 0) && !(a28 == 8))) || (((!(a28 == 7) && a17 <= 8) && !(a28 == 11)) && a11 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((a19 == 1 && a28 == 7) && a17 <= 8) && a25 == 1) || (((a19 <= 0 && a17 == 8) && a28 == 7) && !(a11 == 1))) || ((((a19 <= 0 && !(a25 == 1)) && a28 == 7) && a17 <= 8) && a11 == 1)) || (((a19 == 1 && !(a28 == 7) && a17 <= 8) && a25 == 1) && !(a28 == 11))) || ((((!(a28 == 7) && a17 <= 8) && !(a28 == 11)) && a19 <= 0) && !(a25 == 1))) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1) && !(a11 == 1))) || ((((a17 == 8 && a19 == 1) && a25 == 1) && !(a11 == 1)) && a21 == 1)) || (((((a19 == 1 && !(a28 == 7) && a17 <= 8) && !(a28 == 11)) && !(a28 == 8)) && a17 == 8) && a21 == 1)) || ((((!(a28 == 7) && a17 <= 8) && !(a28 == 11)) && a19 <= 0) && !(a28 == 8))) || (((!(a28 == 7) && a17 <= 8) && !(a28 == 11)) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 22.9s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 18.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 796 SDtfs, 4090 SDslu, 266 SDs, 0 SdLazy, 7492 SolverSat, 1093 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1836occurred in iteration=6, 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1179 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 56 NumberOfFragments, 369 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3452 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1474 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1345 NumberOfCodeBlocks, 1345 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1334 ConstructedInterpolants, 0 QuantifiedInterpolants, 525939 SizeOfPredicates, 1 NumberOfNonLiveVariables, 560 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 537/547 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...