./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id_i10_o10_false-unreach-call_true-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/recursive-simple/id_i10_o10_false-unreach-call_true-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 0aae719d835771c4602eac7b24cfefa200f147c0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:58:49,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:58:49,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:58:49,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:58:49,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:58:49,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:58:49,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:58:49,175 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:58:49,176 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:58:49,177 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:58:49,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:58:49,179 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:58:49,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:58:49,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:58:49,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:58:49,183 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:58:49,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:58:49,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:58:49,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:58:49,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:58:49,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:58:49,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:58:49,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:58:49,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:58:49,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:58:49,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:58:49,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:58:49,198 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:58:49,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:58:49,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:58:49,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:58:49,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:58:49,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:58:49,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:58:49,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:58:49,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:58:49,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:58:49,219 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:58:49,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:58:49,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:58:49,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:58:49,221 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:58:49,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:58:49,222 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:58:49,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:58:49,222 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:58:49,222 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:58:49,222 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:58:49,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:58:49,224 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:58:49,224 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:58:49,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:58:49,224 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:58:49,224 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:58:49,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:58:49,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:58:49,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:58:49,226 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:58:49,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:58:49,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:58:49,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:58:49,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:58:49,227 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:58:49,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:58:49,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:58:49,227 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 -> 0aae719d835771c4602eac7b24cfefa200f147c0 [2019-01-12 14:58:49,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:58:49,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:58:49,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:58:49,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:58:49,297 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:58:49,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id_i10_o10_false-unreach-call_true-termination.c [2019-01-12 14:58:49,361 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccd85514/5d336802731247cfbbbc05349d237c82/FLAG3f69777dd [2019-01-12 14:58:49,788 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:58:49,789 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id_i10_o10_false-unreach-call_true-termination.c [2019-01-12 14:58:49,793 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccd85514/5d336802731247cfbbbc05349d237c82/FLAG3f69777dd [2019-01-12 14:58:50,160 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccd85514/5d336802731247cfbbbc05349d237c82 [2019-01-12 14:58:50,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:58:50,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:58:50,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:58:50,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:58:50,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:58:50,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3483111f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50, skipping insertion in model container [2019-01-12 14:58:50,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:58:50,200 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:58:50,401 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:58:50,405 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:58:50,420 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:58:50,434 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:58:50,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50 WrapperNode [2019-01-12 14:58:50,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:58:50,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:58:50,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:58:50,435 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:58:50,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:58:50,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:58:50,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:58:50,464 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:58:50,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (1/1) ... [2019-01-12 14:58:50,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:58:50,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:58:50,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:58:50,479 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:58:50,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (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 14:58:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:58:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:58:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 14:58:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 14:58:50,774 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:58:50,774 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:58:50,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:58:50 BoogieIcfgContainer [2019-01-12 14:58:50,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:58:50,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:58:50,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:58:50,780 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:58:50,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:58:50" (1/3) ... [2019-01-12 14:58:50,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2c3192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:58:50, skipping insertion in model container [2019-01-12 14:58:50,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:50" (2/3) ... [2019-01-12 14:58:50,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2c3192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:58:50, skipping insertion in model container [2019-01-12 14:58:50,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:58:50" (3/3) ... [2019-01-12 14:58:50,785 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i10_o10_false-unreach-call_true-termination.c [2019-01-12 14:58:50,794 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:58:50,801 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:58:50,813 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:58:50,851 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:58:50,852 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:58:50,852 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:58:50,852 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:58:50,852 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:58:50,853 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:58:50,853 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:58:50,853 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:58:50,853 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:58:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 14:58:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:58:50,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:50,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:50,880 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:50,887 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 14:58:50,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:50,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:50,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:50,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:50,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:51,189 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 14:58:51,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:58:51,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:58:51,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:58:51,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:58:51,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:58:51,209 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 14:58:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:51,360 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 14:58:51,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:58:51,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:58:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:51,372 INFO L225 Difference]: With dead ends: 24 [2019-01-12 14:58:51,373 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 14:58:51,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:58:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 14:58:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 14:58:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 14:58:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 14:58:51,427 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 14:58:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:51,427 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 14:58:51,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:58:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 14:58:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 14:58:51,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:51,439 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:51,439 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:51,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:51,440 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 14:58:51,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:51,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:51,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:51,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:51,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:58:51,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:51,659 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 14:58:51,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:51,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:58:51,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:51,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:58:51,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:58:51,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:58:51,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:58:51,768 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 14:58:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:51,957 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 14:58:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:58:51,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 14:58:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:51,959 INFO L225 Difference]: With dead ends: 21 [2019-01-12 14:58:51,960 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 14:58:51,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:58:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 14:58:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 14:58:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 14:58:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 14:58:51,972 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 14:58:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:51,973 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 14:58:51,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:58:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 14:58:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 14:58:51,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:51,977 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:51,978 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:51,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 14:58:51,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:51,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:51,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:51,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 14:58:52,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:52,211 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 14:58:52,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:58:52,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:58:52,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:52,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 14:58:52,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:52,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:58:52,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:58:52,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:58:52,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:58:52,314 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 14:58:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:52,441 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 14:58:52,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:58:52,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 14:58:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:52,451 INFO L225 Difference]: With dead ends: 24 [2019-01-12 14:58:52,452 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 14:58:52,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:58:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 14:58:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 14:58:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 14:58:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 14:58:52,458 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 14:58:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:52,459 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 14:58:52,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:58:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 14:58:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 14:58:52,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:52,460 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:52,461 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 14:58:52,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:52,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:52,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:52,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:52,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:58:52,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:52,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:52,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:58:52,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 14:58:52,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:52,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:58:53,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:53,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-01-12 14:58:53,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:58:53,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:58:53,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:58:53,207 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2019-01-12 14:58:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:53,496 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 14:58:53,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:58:53,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-12 14:58:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:53,500 INFO L225 Difference]: With dead ends: 27 [2019-01-12 14:58:53,500 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 14:58:53,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:58:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 14:58:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 14:58:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 14:58:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 14:58:53,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 14:58:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:53,507 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 14:58:53,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:58:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 14:58:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:58:53,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:53,509 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:53,509 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:53,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 14:58:53,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:53,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:53,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:53,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:53,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 14:58:53,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:53,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:53,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:58:53,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:58:53,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:53,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 14:58:53,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:53,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 14:58:53,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:58:53,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:58:53,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:58:53,761 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 14:58:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:53,950 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 14:58:53,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:58:53,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 14:58:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:53,954 INFO L225 Difference]: With dead ends: 30 [2019-01-12 14:58:53,954 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 14:58:53,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:58:53,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 14:58:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 14:58:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 14:58:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 14:58:53,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 14:58:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:53,961 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 14:58:53,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:58:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 14:58:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 14:58:53,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:53,963 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:53,963 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 14:58:53,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:53,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:53,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 14:58:54,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:54,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:54,197 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:58:54,234 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 14:58:54,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:54,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 14:58:54,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:54,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2019-01-12 14:58:54,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 14:58:54,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 14:58:54,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-01-12 14:58:54,490 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2019-01-12 14:58:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:54,997 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 14:58:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 14:58:54,998 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-01-12 14:58:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:54,999 INFO L225 Difference]: With dead ends: 33 [2019-01-12 14:58:54,999 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 14:58:55,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 14:58:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 14:58:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 14:58:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 14:58:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 14:58:55,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 14:58:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:55,006 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 14:58:55,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 14:58:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 14:58:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 14:58:55,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:55,009 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:55,009 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:55,010 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 14:58:55,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:55,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:55,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:55,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:55,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 14:58:55,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:55,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:55,340 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:58:55,359 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 14:58:55,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:55,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 14:58:55,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:55,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 14:58:55,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:58:55,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:58:55,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:58:55,398 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 17 states. [2019-01-12 14:58:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:55,579 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 14:58:55,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 14:58:55,580 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-01-12 14:58:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:55,582 INFO L225 Difference]: With dead ends: 36 [2019-01-12 14:58:55,582 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 14:58:55,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:58:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 14:58:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 14:58:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 14:58:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 14:58:55,590 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 14:58:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:55,591 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 14:58:55,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:58:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 14:58:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:58:55,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:55,594 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:55,596 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 14:58:55,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:55,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:55,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 14:58:55,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:55,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:55,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:55,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 14:58:56,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:56,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2019-01-12 14:58:56,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 14:58:56,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 14:58:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2019-01-12 14:58:56,181 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 29 states. [2019-01-12 14:58:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:56,814 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 14:58:56,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 14:58:56,815 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2019-01-12 14:58:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:56,817 INFO L225 Difference]: With dead ends: 39 [2019-01-12 14:58:56,818 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 14:58:56,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=354, Invalid=1538, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:58:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 14:58:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 14:58:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 14:58:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 14:58:56,826 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 14:58:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:56,826 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 14:58:56,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 14:58:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 14:58:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:58:56,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:56,829 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:56,829 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:56,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 14:58:56,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:56,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:56,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:56,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:56,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 14:58:56,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:56,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:56,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:58:57,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:58:57,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:57,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 14:58:57,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:57,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 14:58:57,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 14:58:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 14:58:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 14:58:57,070 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 14:58:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:57,240 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 14:58:57,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 14:58:57,241 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 14:58:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:57,243 INFO L225 Difference]: With dead ends: 42 [2019-01-12 14:58:57,243 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 14:58:57,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:58:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 14:58:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 14:58:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 14:58:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 14:58:57,251 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 14:58:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:57,252 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 14:58:57,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 14:58:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 14:58:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 14:58:57,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:57,254 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:57,254 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 14:58:57,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:57,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:57,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:57,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:57,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 14:58:57,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:57,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:57,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:58:57,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 14:58:57,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:57,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 14:58:58,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:58,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 35 [2019-01-12 14:58:58,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 14:58:58,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 14:58:58,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 14:58:58,067 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 35 states. [2019-01-12 14:58:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:58,583 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 14:58:58,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 14:58:58,584 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2019-01-12 14:58:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:58,586 INFO L225 Difference]: With dead ends: 45 [2019-01-12 14:58:58,586 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 14:58:58,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=531, Invalid=2331, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 14:58:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 14:58:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 14:58:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 14:58:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 14:58:58,596 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 14:58:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:58,596 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 14:58:58,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 14:58:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 14:58:58,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 14:58:58,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:58,600 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:58,600 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:58,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:58,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 14:58:58,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:58,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:58,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:58,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:58,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:58:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:58:58,648 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:58:58,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:58:58 BoogieIcfgContainer [2019-01-12 14:58:58,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:58:58,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:58:58,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:58:58,683 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:58:58,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:58:50" (3/4) ... [2019-01-12 14:58:58,687 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:58:58,760 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:58:58,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:58:58,762 INFO L168 Benchmark]: Toolchain (without parser) took 8595.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 951.3 MB in the beginning and 799.6 MB in the end (delta: 151.8 MB). Peak memory consumption was 348.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:58,764 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 14:58:58,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:58,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.00 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:58:58,765 INFO L168 Benchmark]: Boogie Preprocessor took 15.48 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:58:58,766 INFO L168 Benchmark]: RCFGBuilder took 296.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:58,767 INFO L168 Benchmark]: TraceAbstraction took 7905.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 799.6 MB in the end (delta: 312.5 MB). Peak memory consumption was 375.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:58,768 INFO L168 Benchmark]: Witness Printer took 78.16 ms. Allocated memory is still 1.2 GB. Free memory is still 799.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:58:58,772 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 266.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.00 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.48 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 296.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7905.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 799.6 MB in the end (delta: 312.5 MB). Peak memory consumption was 375.9 MB. Max. memory is 11.5 GB. * Witness Printer took 78.16 ms. Allocated memory is still 1.2 GB. Free memory is still 799.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 10; [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 10 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 7.8s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 91 SDtfs, 121 SDslu, 569 SDs, 0 SdLazy, 575 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 780 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 70496 SizeOfPredicates, 46 NumberOfNonLiveVariables, 826 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 900/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...