./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.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/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.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 ceb806ae997f94b7f09b4e2dce31a0e63ff1a329 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:07:06,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:07:06,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:07:06,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:07:06,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:07:06,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:07:06,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:07:06,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:07:06,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:07:06,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:07:06,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:07:06,277 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:07:06,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:07:06,280 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:07:06,281 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:07:06,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:07:06,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:07:06,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:07:06,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:07:06,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:07:06,291 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:07:06,292 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:07:06,295 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:07:06,295 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:07:06,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:07:06,297 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:07:06,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:07:06,299 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:07:06,300 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:07:06,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:07:06,301 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:07:06,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:07:06,302 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:07:06,302 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:07:06,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:07:06,304 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:07:06,305 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:07:06,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:07:06,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:07:06,329 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:07:06,329 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:07:06,329 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:07:06,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:07:06,330 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:07:06,330 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:07:06,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:07:06,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:07:06,330 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:07:06,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:07:06,331 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:07:06,331 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:07:06,331 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:07:06,331 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:07:06,331 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:07:06,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:07:06,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:07:06,332 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:07:06,332 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:07:06,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:07:06,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:07:06,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:07:06,333 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:07:06,333 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:07:06,333 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:07:06,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:07:06,333 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 -> ceb806ae997f94b7f09b4e2dce31a0e63ff1a329 [2018-12-31 10:07:06,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:07:06,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:07:06,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:07:06,396 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:07:06,397 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:07:06,399 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-12-31 10:07:06,470 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c606d09fe/34867e92f43549e4b60d4b7776243b32/FLAG8430b3c32 [2018-12-31 10:07:06,938 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:07:06,939 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-12-31 10:07:06,946 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c606d09fe/34867e92f43549e4b60d4b7776243b32/FLAG8430b3c32 [2018-12-31 10:07:07,284 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c606d09fe/34867e92f43549e4b60d4b7776243b32 [2018-12-31 10:07:07,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:07:07,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:07:07,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:07:07,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:07:07,297 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:07:07,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:07:07" (1/1) ... [2018-12-31 10:07:07,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4adfdd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07, skipping insertion in model container [2018-12-31 10:07:07,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:07:07" (1/1) ... [2018-12-31 10:07:07,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:07:07,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:07:07,523 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:07:07,532 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:07:07,554 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:07:07,571 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:07:07,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07 WrapperNode [2018-12-31 10:07:07,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:07:07,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:07:07,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:07:07,573 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:07:07,585 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:07:07" (1/1) ... [2018-12-31 10:07:07,591 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:07:07" (1/1) ... [2018-12-31 10:07:07,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:07:07,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:07:07,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:07:07,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:07:07,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07" (1/1) ... [2018-12-31 10:07:07,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07" (1/1) ... [2018-12-31 10:07:07,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07" (1/1) ... [2018-12-31 10:07:07,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07" (1/1) ... [2018-12-31 10:07:07,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07" (1/1) ... [2018-12-31 10:07:07,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07" (1/1) ... [2018-12-31 10:07:07,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07" (1/1) ... [2018-12-31 10:07:07,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:07:07,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:07:07,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:07:07,636 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:07:07,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07" (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:07:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-12-31 10:07:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-12-31 10:07:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:07:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:07:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-12-31 10:07:07,811 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-12-31 10:07:08,153 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:07:08,153 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 10:07:08,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:07:08 BoogieIcfgContainer [2018-12-31 10:07:08,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:07:08,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:07:08,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:07:08,159 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:07:08,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:07:07" (1/3) ... [2018-12-31 10:07:08,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dac3460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:07:08, skipping insertion in model container [2018-12-31 10:07:08,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:07:07" (2/3) ... [2018-12-31 10:07:08,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dac3460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:07:08, skipping insertion in model container [2018-12-31 10:07:08,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:07:08" (3/3) ... [2018-12-31 10:07:08,165 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-12-31 10:07:08,177 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:07:08,186 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 10:07:08,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 10:07:08,234 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:07:08,235 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:07:08,236 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:07:08,236 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:07:08,236 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:07:08,236 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:07:08,236 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:07:08,237 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:07:08,237 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:07:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-31 10:07:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 10:07:08,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:08,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:08,268 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:08,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:08,275 INFO L82 PathProgramCache]: Analyzing trace with hash -394807891, now seen corresponding path program 1 times [2018-12-31 10:07:08,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:08,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:08,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:08,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:08,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:08,604 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:07:08,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:08,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:07:08,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:07:08,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:07:08,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:08,632 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-12-31 10:07:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:08,705 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-31 10:07:08,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:07:08,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 10:07:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:08,717 INFO L225 Difference]: With dead ends: 35 [2018-12-31 10:07:08,717 INFO L226 Difference]: Without dead ends: 22 [2018-12-31 10:07:08,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-31 10:07:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-31 10:07:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 10:07:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-12-31 10:07:08,763 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2018-12-31 10:07:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:08,764 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-12-31 10:07:08,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:07:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-12-31 10:07:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 10:07:08,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:08,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:08,767 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:08,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1343664860, now seen corresponding path program 1 times [2018-12-31 10:07:08,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:08,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:08,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:08,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:08,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:08,946 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:07:08,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:08,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:07:08,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:07:08,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:07:08,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:08,949 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2018-12-31 10:07:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:09,074 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-12-31 10:07:09,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:07:09,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-31 10:07:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:09,078 INFO L225 Difference]: With dead ends: 40 [2018-12-31 10:07:09,078 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 10:07:09,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 10:07:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 10:07:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 10:07:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-31 10:07:09,087 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2018-12-31 10:07:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:09,087 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-31 10:07:09,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:07:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-31 10:07:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 10:07:09,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:09,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:09,089 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:09,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:09,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1372294011, now seen corresponding path program 1 times [2018-12-31 10:07:09,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:09,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:09,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:09,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:09,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:09,457 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:07:09,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:09,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 10:07:09,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 10:07:09,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 10:07:09,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 10:07:09,464 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 8 states. [2018-12-31 10:07:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:09,547 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-31 10:07:09,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 10:07:09,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-31 10:07:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:09,554 INFO L225 Difference]: With dead ends: 32 [2018-12-31 10:07:09,554 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 10:07:09,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:07:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 10:07:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 10:07:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 10:07:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-31 10:07:09,563 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2018-12-31 10:07:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:09,563 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-31 10:07:09,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 10:07:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-31 10:07:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 10:07:09,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:09,566 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:09,566 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1000474712, now seen corresponding path program 1 times [2018-12-31 10:07:09,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:09,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:09,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:07:09,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:09,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:07:09,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:07:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:07:09,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:09,737 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-12-31 10:07:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:09,769 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-12-31 10:07:09,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:07:09,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-31 10:07:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:09,772 INFO L225 Difference]: With dead ends: 44 [2018-12-31 10:07:09,772 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 10:07:09,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 10:07:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-31 10:07:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 10:07:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-31 10:07:09,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2018-12-31 10:07:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:09,785 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-31 10:07:09,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:07:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-31 10:07:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 10:07:09,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:09,787 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:09,787 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1196988217, now seen corresponding path program 1 times [2018-12-31 10:07:09,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:09,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:09,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:09,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:09,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:07:09,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:09,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:07:09,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:07:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:07:09,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:09,941 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-12-31 10:07:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:09,979 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-31 10:07:09,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:07:09,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-31 10:07:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:09,982 INFO L225 Difference]: With dead ends: 36 [2018-12-31 10:07:09,982 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 10:07:09,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 10:07:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-31 10:07:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 10:07:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-31 10:07:09,989 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2018-12-31 10:07:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:09,989 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-31 10:07:09,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:07:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-31 10:07:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 10:07:09,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:09,991 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:09,991 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:09,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1168359066, now seen corresponding path program 1 times [2018-12-31 10:07:09,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:09,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:09,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:10,707 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:07:10,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:07:10,707 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:07:10,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:10,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:07:10,868 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:07:10,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:07:10,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-31 10:07:10,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 10:07:10,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 10:07:10,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-31 10:07:10,899 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 12 states. [2018-12-31 10:07:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:11,106 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-12-31 10:07:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:07:11,107 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-12-31 10:07:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:11,108 INFO L225 Difference]: With dead ends: 52 [2018-12-31 10:07:11,109 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 10:07:11,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-31 10:07:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 10:07:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-12-31 10:07:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 10:07:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-31 10:07:11,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2018-12-31 10:07:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:11,117 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-31 10:07:11,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 10:07:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-31 10:07:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 10:07:11,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:11,118 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:11,119 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash -26461427, now seen corresponding path program 1 times [2018-12-31 10:07:11,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:11,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:11,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:07:11,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:07:11,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:07:11,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:07:11,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:07:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:11,287 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-12-31 10:07:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:11,379 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-31 10:07:11,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:07:11,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 10:07:11,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:11,382 INFO L225 Difference]: With dead ends: 50 [2018-12-31 10:07:11,382 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 10:07:11,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:07:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 10:07:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-31 10:07:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 10:07:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-31 10:07:11,389 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 30 [2018-12-31 10:07:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:11,389 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-31 10:07:11,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:07:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-31 10:07:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 10:07:11,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:11,391 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:11,392 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:11,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash -222974932, now seen corresponding path program 1 times [2018-12-31 10:07:11,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:11,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:11,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:07:12,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:07:12,070 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:07:12,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:12,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:07:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:07:12,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:07:12,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-12-31 10:07:12,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 10:07:12,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 10:07:12,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-12-31 10:07:12,188 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 15 states. [2018-12-31 10:07:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:12,731 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-12-31 10:07:12,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 10:07:12,733 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-12-31 10:07:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:12,734 INFO L225 Difference]: With dead ends: 70 [2018-12-31 10:07:12,734 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 10:07:12,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-12-31 10:07:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 10:07:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2018-12-31 10:07:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 10:07:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-12-31 10:07:12,743 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2018-12-31 10:07:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:12,744 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-12-31 10:07:12,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 10:07:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-12-31 10:07:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 10:07:12,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:12,745 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:12,746 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:12,746 INFO L82 PathProgramCache]: Analyzing trace with hash -141607649, now seen corresponding path program 2 times [2018-12-31 10:07:12,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:12,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:12,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:12,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:07:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-31 10:07:13,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:07:13,390 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:07:13,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:07:13,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:07:13,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:07:13,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:07:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-31 10:07:13,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:07:13,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 17 [2018-12-31 10:07:13,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 10:07:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 10:07:13,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-12-31 10:07:13,476 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 17 states. [2018-12-31 10:07:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:13,679 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-12-31 10:07:13,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 10:07:13,680 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-12-31 10:07:13,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:13,681 INFO L225 Difference]: With dead ends: 74 [2018-12-31 10:07:13,681 INFO L226 Difference]: Without dead ends: 56 [2018-12-31 10:07:13,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-12-31 10:07:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-31 10:07:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-12-31 10:07:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 10:07:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-12-31 10:07:13,690 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 37 [2018-12-31 10:07:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:13,691 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-12-31 10:07:13,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 10:07:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-12-31 10:07:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 10:07:13,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:07:13,693 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:07:13,693 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:07:13,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:07:13,693 INFO L82 PathProgramCache]: Analyzing trace with hash -90623267, now seen corresponding path program 2 times [2018-12-31 10:07:13,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:07:13,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:07:13,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:13,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:07:13,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:07:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:07:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-31 10:07:13,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:07:13,929 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:07:13,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:07:13,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-31 10:07:13,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:07:13,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:07:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-31 10:07:14,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 10:07:14,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2018-12-31 10:07:14,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 10:07:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 10:07:14,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-12-31 10:07:14,146 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 17 states. [2018-12-31 10:07:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:07:14,322 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-12-31 10:07:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 10:07:14,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-31 10:07:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:07:14,324 INFO L225 Difference]: With dead ends: 62 [2018-12-31 10:07:14,324 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 10:07:14,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-31 10:07:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 10:07:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 10:07:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 10:07:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 10:07:14,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-12-31 10:07:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:07:14,331 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 10:07:14,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 10:07:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 10:07:14,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 10:07:14,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 10:07:14,408 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-12-31 10:07:14,409 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true [2018-12-31 10:07:14,409 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-12-31 10:07:14,409 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-12-31 10:07:14,409 INFO L448 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2018-12-31 10:07:14,409 INFO L451 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2018-12-31 10:07:14,409 INFO L448 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2018-12-31 10:07:14,409 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 10:07:14,410 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 10:07:14,410 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 10:07:14,410 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-31 10:07:14,410 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-12-31 10:07:14,410 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-12-31 10:07:14,410 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-31 10:07:14,410 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 27) no Hoare annotation was computed. [2018-12-31 10:07:14,410 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-12-31 10:07:14,411 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2018-12-31 10:07:14,411 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2018-12-31 10:07:14,411 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-12-31 10:07:14,411 INFO L451 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: true [2018-12-31 10:07:14,411 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-12-31 10:07:14,411 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-12-31 10:07:14,411 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2018-12-31 10:07:14,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:07:14 BoogieIcfgContainer [2018-12-31 10:07:14,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:07:14,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:07:14,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:07:14,416 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:07:14,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:07:08" (3/4) ... [2018-12-31 10:07:14,421 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 10:07:14,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2018-12-31 10:07:14,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2018-12-31 10:07:14,435 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 10:07:14,435 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 10:07:14,522 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:07:14,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:07:14,527 INFO L168 Benchmark]: Toolchain (without parser) took 7237.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:14,530 INFO L168 Benchmark]: CDTParser took 0.19 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:07:14,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.67 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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:07:14,531 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:07:14,532 INFO L168 Benchmark]: Boogie Preprocessor took 22.56 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:07:14,532 INFO L168 Benchmark]: RCFGBuilder took 518.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:14,535 INFO L168 Benchmark]: TraceAbstraction took 6259.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -30.5 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2018-12-31 10:07:14,540 INFO L168 Benchmark]: Witness Printer took 106.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:07:14,545 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.19 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 280.67 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 39.56 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.56 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 518.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6259.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -30.5 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * Witness Printer took 106.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. SAFE Result, 6.1s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 37 SDslu, 1727 SDs, 0 SdLazy, 527 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 139 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 5 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 385 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 36403 SizeOfPredicates, 13 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 121/165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...