./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/sum_15x0_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/sum_15x0_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 31319b3dce926b7eddaa50d24c240f6870931f21 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-31 10:04:56,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:04:56,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:04:56,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:04:56,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:04:56,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:04:56,372 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:04:56,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:04:56,376 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:04:56,377 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:04:56,378 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:04:56,378 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:04:56,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:04:56,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:04:56,382 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:04:56,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:04:56,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:04:56,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:04:56,389 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:04:56,391 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:04:56,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:04:56,393 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:04:56,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:04:56,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:04:56,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:04:56,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:04:56,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:04:56,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:04:56,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:04:56,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:04:56,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:04:56,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:04:56,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:04:56,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:04:56,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:04:56,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:04:56,407 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:04:56,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:04:56,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:04:56,440 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:04:56,440 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:04:56,440 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:04:56,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:04:56,441 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:04:56,441 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:04:56,441 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:04:56,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:04:56,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:04:56,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:04:56,442 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:04:56,444 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:04:56,444 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:04:56,444 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:04:56,445 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:04:56,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:04:56,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:04:56,445 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:04:56,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:04:56,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:04:56,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:04:56,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:04:56,446 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:04:56,446 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:04:56,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:04:56,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:04:56,450 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 -> 31319b3dce926b7eddaa50d24c240f6870931f21 [2018-12-31 10:04:56,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:04:56,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:04:56,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:04:56,547 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:04:56,548 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:04:56,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/sum_15x0_false-unreach-call_true-termination.c [2018-12-31 10:04:56,618 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ae59822/606595245e5f4b06ae8da2dd3c85c092/FLAG15ceadca2 [2018-12-31 10:04:57,042 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:04:57,042 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/sum_15x0_false-unreach-call_true-termination.c [2018-12-31 10:04:57,048 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ae59822/606595245e5f4b06ae8da2dd3c85c092/FLAG15ceadca2 [2018-12-31 10:04:57,429 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ae59822/606595245e5f4b06ae8da2dd3c85c092 [2018-12-31 10:04:57,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:04:57,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:04:57,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:04:57,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:04:57,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:04:57,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179a4755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57, skipping insertion in model container [2018-12-31 10:04:57,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:04:57,471 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:04:57,705 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:04:57,713 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:04:57,735 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:04:57,753 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:04:57,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57 WrapperNode [2018-12-31 10:04:57,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:04:57,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:04:57,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:04:57,756 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:04:57,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:04:57,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:04:57,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:04:57,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:04:57,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (1/1) ... [2018-12-31 10:04:57,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:04:57,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:04:57,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:04:57,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:04:57,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:04:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:04:57,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:04:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-12-31 10:04:57,952 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-12-31 10:04:58,181 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:04:58,181 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 10:04:58,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:04:58 BoogieIcfgContainer [2018-12-31 10:04:58,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:04:58,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:04:58,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:04:58,186 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:04:58,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:04:57" (1/3) ... [2018-12-31 10:04:58,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7966c498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:04:58, skipping insertion in model container [2018-12-31 10:04:58,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:57" (2/3) ... [2018-12-31 10:04:58,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7966c498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:04:58, skipping insertion in model container [2018-12-31 10:04:58,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:04:58" (3/3) ... [2018-12-31 10:04:58,190 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0_false-unreach-call_true-termination.c [2018-12-31 10:04:58,200 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:04:58,209 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 10:04:58,228 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 10:04:58,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:04:58,265 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:04:58,265 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:04:58,265 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:04:58,265 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:04:58,265 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:04:58,266 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:04:58,266 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:04:58,266 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:04:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-12-31 10:04:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 10:04:58,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:58,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:58,303 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:58,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:58,310 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2018-12-31 10:04:58,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:58,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:58,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:04:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:04:58,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:04:58,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:04:58,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:04:58,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:04:58,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:04:58,718 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2018-12-31 10:04:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:58,863 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-12-31 10:04:58,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:04:58,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 10:04:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:58,876 INFO L225 Difference]: With dead ends: 24 [2018-12-31 10:04:58,877 INFO L226 Difference]: Without dead ends: 14 [2018-12-31 10:04:58,880 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 [2018-12-31 10:04:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-31 10:04:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-31 10:04:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-31 10:04:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-12-31 10:04:58,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2018-12-31 10:04:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:58,924 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-12-31 10:04:58,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:04:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-12-31 10:04:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 10:04:58,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:58,926 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:58,926 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:58,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:58,927 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2018-12-31 10:04:58,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:58,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:58,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:58,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:04:58,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:04:59,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:59,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:04:59,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:04:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:59,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:04:59,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:59,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 10:04:59,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 10:04:59,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 10:04:59,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 10:04:59,188 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2018-12-31 10:04:59,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:59,522 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-31 10:04:59,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:04:59,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-31 10:04:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:59,524 INFO L225 Difference]: With dead ends: 21 [2018-12-31 10:04:59,524 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 10:04:59,525 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 [2018-12-31 10:04:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 10:04:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 10:04:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 10:04:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-31 10:04:59,532 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-12-31 10:04:59,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:59,532 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-31 10:04:59,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 10:04:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-31 10:04:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 10:04:59,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:59,534 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:59,534 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:59,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2018-12-31 10:04:59,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:59,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:59,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:59,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:04:59,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 10:04:59,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:59,716 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 [2018-12-31 10:04:59,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:04:59,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:04:59,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:04:59,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 10:04:59,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:59,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 10:04:59,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 10:04:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 10:04:59,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:04:59,828 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2018-12-31 10:05:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:00,064 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-31 10:05:00,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 10:05:00,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-31 10:05:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:00,067 INFO L225 Difference]: With dead ends: 24 [2018-12-31 10:05:00,067 INFO L226 Difference]: Without dead ends: 20 [2018-12-31 10:05:00,069 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 [2018-12-31 10:05:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-31 10:05:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-31 10:05:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-31 10:05:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-31 10:05:00,075 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2018-12-31 10:05:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:00,075 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-31 10:05:00,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 10:05:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-31 10:05:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 10:05:00,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:00,077 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:00,077 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:00,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2018-12-31 10:05:00,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:00,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:00,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:00,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:00,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-31 10:05:00,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:00,240 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 [2018-12-31 10:05:00,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 10:05:00,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 10:05:00,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:05:00,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-31 10:05:00,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:00,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-31 10:05:00,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 10:05:00,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 10:05:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 10:05:00,346 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2018-12-31 10:05:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:00,832 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-31 10:05:00,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 10:05:00,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-31 10:05:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:00,834 INFO L225 Difference]: With dead ends: 27 [2018-12-31 10:05:00,834 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 10:05:00,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-31 10:05:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 10:05:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-31 10:05:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 10:05:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-31 10:05:00,841 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2018-12-31 10:05:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:00,841 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-31 10:05:00,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 10:05:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-31 10:05:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 10:05:00,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:00,843 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:00,843 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:00,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:00,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2018-12-31 10:05:00,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:00,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:00,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:00,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:00,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-31 10:05:00,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:00,992 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 [2018-12-31 10:05:01,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 10:05:01,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 10:05:01,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:05:01,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-31 10:05:01,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:01,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-31 10:05:01,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 10:05:01,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 10:05:01,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:05:01,086 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-12-31 10:05:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:01,220 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-31 10:05:01,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 10:05:01,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-31 10:05:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:01,223 INFO L225 Difference]: With dead ends: 30 [2018-12-31 10:05:01,223 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 10:05:01,224 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 [2018-12-31 10:05:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 10:05:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 10:05:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 10:05:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-12-31 10:05:01,230 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2018-12-31 10:05:01,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:01,230 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-12-31 10:05:01,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 10:05:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-12-31 10:05:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 10:05:01,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:01,232 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:01,232 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:01,233 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2018-12-31 10:05:01,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:01,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:01,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:01,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:01,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-31 10:05:01,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:01,482 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 [2018-12-31 10:05:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 10:05:01,606 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-31 10:05:01,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:05:01,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-31 10:05:01,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:01,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-31 10:05:01,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 10:05:01,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 10:05:01,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-31 10:05:01,693 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 10 states. [2018-12-31 10:05:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:01,918 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-31 10:05:01,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 10:05:01,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-31 10:05:01,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:01,921 INFO L225 Difference]: With dead ends: 33 [2018-12-31 10:05:01,921 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 10:05:01,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-12-31 10:05:01,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 10:05:01,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-31 10:05:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 10:05:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-31 10:05:01,929 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2018-12-31 10:05:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:01,930 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-31 10:05:01,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 10:05:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-31 10:05:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 10:05:01,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:01,932 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:01,932 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2018-12-31 10:05:01,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:01,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:01,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:01,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-31 10:05:02,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:02,136 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 [2018-12-31 10:05:02,149 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 10:05:02,182 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-31 10:05:02,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:05:02,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-31 10:05:02,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:02,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-31 10:05:02,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 10:05:02,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 10:05:02,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-31 10:05:02,232 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2018-12-31 10:05:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:02,470 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-12-31 10:05:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:05:02,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-12-31 10:05:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:02,474 INFO L225 Difference]: With dead ends: 36 [2018-12-31 10:05:02,474 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 10:05:02,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-12-31 10:05:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 10:05:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-31 10:05:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 10:05:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-31 10:05:02,482 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2018-12-31 10:05:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:02,482 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-31 10:05:02,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 10:05:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-31 10:05:02,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 10:05:02,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:02,484 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:02,485 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:02,485 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2018-12-31 10:05:02,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:02,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:02,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:02,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:02,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-31 10:05:02,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:02,674 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 [2018-12-31 10:05:02,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:05:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:02,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-31 10:05:02,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:02,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-12-31 10:05:02,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 10:05:02,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 10:05:02,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-31 10:05:02,767 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2018-12-31 10:05:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:03,145 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-31 10:05:03,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 10:05:03,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-12-31 10:05:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:03,147 INFO L225 Difference]: With dead ends: 39 [2018-12-31 10:05:03,148 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 10:05:03,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-12-31 10:05:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 10:05:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-31 10:05:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-31 10:05:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-31 10:05:03,155 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2018-12-31 10:05:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:03,155 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-31 10:05:03,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 10:05:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-31 10:05:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 10:05:03,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:03,157 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:03,157 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:03,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2018-12-31 10:05:03,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:03,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:03,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:03,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:05:03,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-31 10:05:03,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:03,879 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 [2018-12-31 10:05:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:05:03,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:05:03,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:05:03,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-31 10:05:03,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:03,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-12-31 10:05:03,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 10:05:03,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 10:05:03,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-31 10:05:03,995 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2018-12-31 10:05:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:04,231 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-31 10:05:04,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 10:05:04,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-12-31 10:05:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:04,234 INFO L225 Difference]: With dead ends: 42 [2018-12-31 10:05:04,234 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 10:05:04,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-12-31 10:05:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 10:05:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-31 10:05:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 10:05:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-31 10:05:04,244 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2018-12-31 10:05:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:04,244 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-31 10:05:04,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 10:05:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-31 10:05:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 10:05:04,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:04,246 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:04,246 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:04,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2018-12-31 10:05:04,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:04,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:04,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:04,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-31 10:05:04,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:04,482 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 [2018-12-31 10:05:04,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 10:05:04,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-31 10:05:04,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:05:04,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-31 10:05:04,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:04,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-12-31 10:05:04,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 10:05:04,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 10:05:04,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-31 10:05:04,665 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2018-12-31 10:05:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:04,907 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-31 10:05:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 10:05:04,908 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-12-31 10:05:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:04,910 INFO L225 Difference]: With dead ends: 45 [2018-12-31 10:05:04,910 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 10:05:04,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-12-31 10:05:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 10:05:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 10:05:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 10:05:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-31 10:05:04,917 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2018-12-31 10:05:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:04,917 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-31 10:05:04,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 10:05:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-31 10:05:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 10:05:04,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:04,919 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:04,919 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:04,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:04,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2018-12-31 10:05:04,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:04,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:04,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:04,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:04,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-31 10:05:05,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:05,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:05:05,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 10:05:05,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 10:05:05,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:05:05,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-31 10:05:05,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:05,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-12-31 10:05:05,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 10:05:05,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 10:05:05,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-12-31 10:05:05,412 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2018-12-31 10:05:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:05,655 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-12-31 10:05:05,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 10:05:05,656 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2018-12-31 10:05:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:05,658 INFO L225 Difference]: With dead ends: 48 [2018-12-31 10:05:05,658 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 10:05:05,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-12-31 10:05:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 10:05:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-31 10:05:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 10:05:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-31 10:05:05,665 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2018-12-31 10:05:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:05,666 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-31 10:05:05,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 10:05:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-31 10:05:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 10:05:05,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:05,668 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:05,668 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2018-12-31 10:05:05,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:05,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:05,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-31 10:05:06,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:06,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:05:06,082 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 10:05:06,151 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-12-31 10:05:06,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:05:06,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-31 10:05:06,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:06,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-12-31 10:05:06,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 10:05:06,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 10:05:06,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-12-31 10:05:06,227 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2018-12-31 10:05:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:06,682 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-31 10:05:06,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 10:05:06,683 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-12-31 10:05:06,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:06,684 INFO L225 Difference]: With dead ends: 51 [2018-12-31 10:05:06,684 INFO L226 Difference]: Without dead ends: 47 [2018-12-31 10:05:06,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-12-31 10:05:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-31 10:05:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-31 10:05:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-31 10:05:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-31 10:05:06,697 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2018-12-31 10:05:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:06,698 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-31 10:05:06,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 10:05:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-31 10:05:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 10:05:06,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:06,702 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:06,702 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:06,702 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2018-12-31 10:05:06,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:06,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:06,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:06,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:06,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-12-31 10:05:07,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:07,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:05:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 10:05:07,118 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-12-31 10:05:07,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:05:07,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-12-31 10:05:07,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:07,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-12-31 10:05:07,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 10:05:07,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 10:05:07,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2018-12-31 10:05:07,195 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 17 states. [2018-12-31 10:05:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:07,597 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-12-31 10:05:07,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 10:05:07,598 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-12-31 10:05:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:07,600 INFO L225 Difference]: With dead ends: 54 [2018-12-31 10:05:07,600 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 10:05:07,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-12-31 10:05:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 10:05:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-31 10:05:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 10:05:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-12-31 10:05:07,610 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2018-12-31 10:05:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:07,610 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-12-31 10:05:07,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 10:05:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-12-31 10:05:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-31 10:05:07,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:07,614 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:07,614 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:07,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:07,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2018-12-31 10:05:07,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:07,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:07,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:07,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-31 10:05:07,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:07,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:05:07,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:05:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:07,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-31 10:05:08,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:08,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-12-31 10:05:08,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 10:05:08,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 10:05:08,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-12-31 10:05:08,040 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 18 states. [2018-12-31 10:05:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:08,356 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-31 10:05:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 10:05:08,358 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-12-31 10:05:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:08,360 INFO L225 Difference]: With dead ends: 57 [2018-12-31 10:05:08,360 INFO L226 Difference]: Without dead ends: 53 [2018-12-31 10:05:08,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-12-31 10:05:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-31 10:05:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-31 10:05:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-31 10:05:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-31 10:05:08,367 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2018-12-31 10:05:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:08,368 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-31 10:05:08,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 10:05:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-31 10:05:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 10:05:08,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:08,371 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:08,372 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2018-12-31 10:05:08,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:08,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:08,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:05:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:05:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-31 10:05:08,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:05:08,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:05:08,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:05:08,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:05:08,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:05:08,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:05:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-31 10:05:08,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:05:08,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-12-31 10:05:08,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 10:05:08,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 10:05:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2018-12-31 10:05:08,813 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 19 states. [2018-12-31 10:05:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:05:09,203 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-12-31 10:05:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 10:05:09,204 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-12-31 10:05:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:05:09,206 INFO L225 Difference]: With dead ends: 60 [2018-12-31 10:05:09,206 INFO L226 Difference]: Without dead ends: 56 [2018-12-31 10:05:09,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-12-31 10:05:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-31 10:05:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-31 10:05:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 10:05:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-31 10:05:09,216 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2018-12-31 10:05:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:05:09,216 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-31 10:05:09,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 10:05:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-31 10:05:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 10:05:09,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:05:09,224 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:05:09,225 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:05:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:05:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2018-12-31 10:05:09,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:05:09,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:05:09,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:09,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:05:09,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:05:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:05:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:05:09,285 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 10:05:09,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:05:09 BoogieIcfgContainer [2018-12-31 10:05:09,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:05:09,351 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:05:09,351 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:05:09,351 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:05:09,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:04:58" (3/4) ... [2018-12-31 10:05:09,356 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 10:05:09,440 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:05:09,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:05:09,442 INFO L168 Benchmark]: Toolchain (without parser) took 12008.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.5 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -48.9 MB). Peak memory consumption was 220.6 MB. Max. memory is 11.5 GB. [2018-12-31 10:05:09,444 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:05:09,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.57 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. [2018-12-31 10:05:09,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.70 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. [2018-12-31 10:05:09,446 INFO L168 Benchmark]: Boogie Preprocessor took 20.64 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. [2018-12-31 10:05:09,447 INFO L168 Benchmark]: RCFGBuilder took 366.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-31 10:05:09,447 INFO L168 Benchmark]: TraceAbstraction took 11167.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 244.5 MB. Max. memory is 11.5 GB. [2018-12-31 10:05:09,449 INFO L168 Benchmark]: Witness Printer took 90.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-12-31 10:05:09,454 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.57 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 37.70 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 20.64 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 366.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11167.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 244.5 MB. Max. memory is 11.5 GB. * Witness Printer took 90.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 15; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 11.0s OverallTime, 16 OverallIterations, 16 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 319 SDslu, 646 SDs, 0 SdLazy, 912 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1147 GetRequests, 877 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=15, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 1492 ConstructedInterpolants, 0 QuantifiedInterpolants, 245632 SizeOfPredicates, 133 NumberOfNonLiveVariables, 2296 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 29 InterpolantComputations, 1 PerfectInterpolantSequences, 3150/6300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...