./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann01-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/recursive/Ackermann01-2.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 c2f1e635c5c806286d01eb0b8ff07448b8253a7a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:23:57,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:23:57,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:23:57,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:23:57,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:23:57,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:23:57,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:23:57,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:23:57,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:23:57,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:23:57,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:23:57,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:23:57,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:23:57,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:23:57,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:23:57,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:23:57,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:23:57,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:23:57,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:23:57,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:23:57,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:23:57,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:23:57,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:23:57,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:23:57,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:23:57,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:23:57,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:23:57,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:23:57,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:23:57,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:23:57,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:23:57,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:23:57,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:23:57,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:23:57,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:23:57,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:23:57,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:23:57,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:23:57,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:23:57,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:23:57,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:23:57,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:23:57,388 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:23:57,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:23:57,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:23:57,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:23:57,392 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:23:57,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:23:57,393 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:23:57,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:23:57,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:23:57,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:23:57,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:23:57,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:23:57,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:23:57,397 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:23:57,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:23:57,397 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:23:57,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:23:57,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:23:57,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:23:57,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:23:57,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:23:57,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:23:57,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:23:57,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:23:57,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:23:57,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:23:57,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:23:57,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:23:57,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> c2f1e635c5c806286d01eb0b8ff07448b8253a7a [2019-11-28 00:23:57,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:23:57,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:23:57,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:23:57,722 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:23:57,722 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:23:57,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann01-2.c [2019-11-28 00:23:57,799 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cab6ddab/307696ea98e742cda0f4acb7e6a2923d/FLAG42d472586 [2019-11-28 00:23:58,203 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:23:58,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c [2019-11-28 00:23:58,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cab6ddab/307696ea98e742cda0f4acb7e6a2923d/FLAG42d472586 [2019-11-28 00:23:58,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cab6ddab/307696ea98e742cda0f4acb7e6a2923d [2019-11-28 00:23:58,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:23:58,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:23:58,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:23:58,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:23:58,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:23:58,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cff6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58, skipping insertion in model container [2019-11-28 00:23:58,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:23:58,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:23:58,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:23:58,815 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:23:58,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:23:58,842 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:23:58,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58 WrapperNode [2019-11-28 00:23:58,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:23:58,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:23:58,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:23:58,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:23:58,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:23:58,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:23:58,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:23:58,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:23:58,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (1/1) ... [2019-11-28 00:23:58,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:23:58,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:23:58,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:23:58,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:23:58,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:23:59,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:23:59,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:23:59,008 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-11-28 00:23:59,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-11-28 00:23:59,200 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:23:59,201 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:23:59,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:23:59 BoogieIcfgContainer [2019-11-28 00:23:59,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:23:59,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:23:59,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:23:59,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:23:59,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:23:58" (1/3) ... [2019-11-28 00:23:59,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9423d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:23:59, skipping insertion in model container [2019-11-28 00:23:59,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:58" (2/3) ... [2019-11-28 00:23:59,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9423d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:23:59, skipping insertion in model container [2019-11-28 00:23:59,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:23:59" (3/3) ... [2019-11-28 00:23:59,215 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2019-11-28 00:23:59,250 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:23:59,265 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:23:59,293 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:23:59,326 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:23:59,326 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:23:59,326 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:23:59,327 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:23:59,327 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:23:59,327 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:23:59,327 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:23:59,327 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:23:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-28 00:23:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:23:59,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:23:59,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:23:59,350 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:23:59,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:23:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2019-11-28 00:23:59,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:23:59,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695067037] [2019-11-28 00:23:59,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:23:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:23:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:23:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:23:59,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695067037] [2019-11-28 00:23:59,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:23:59,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:23:59,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452510342] [2019-11-28 00:23:59,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:23:59,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:23:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:23:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:23:59,611 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 7 states. [2019-11-28 00:23:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:23:59,822 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-11-28 00:23:59,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:23:59,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-28 00:23:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:23:59,835 INFO L225 Difference]: With dead ends: 37 [2019-11-28 00:23:59,835 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 00:23:59,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:23:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 00:23:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 00:23:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 00:23:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-28 00:23:59,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2019-11-28 00:23:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:23:59,883 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 00:23:59,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:23:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-11-28 00:23:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:23:59,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:23:59,886 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:23:59,886 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:23:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:23:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2019-11-28 00:23:59,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:23:59,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541164406] [2019-11-28 00:23:59,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:23:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:23:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:23:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:24:00,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541164406] [2019-11-28 00:24:00,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:00,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 00:24:00,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232066598] [2019-11-28 00:24:00,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:24:00,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:00,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:24:00,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:24:00,065 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 8 states. [2019-11-28 00:24:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:00,259 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-11-28 00:24:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:24:00,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-28 00:24:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:00,262 INFO L225 Difference]: With dead ends: 28 [2019-11-28 00:24:00,262 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 00:24:00,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:24:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 00:24:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-28 00:24:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 00:24:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-28 00:24:00,272 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2019-11-28 00:24:00,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:00,273 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 00:24:00,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:24:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-11-28 00:24:00,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:24:00,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:00,275 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:00,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:00,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:00,276 INFO L82 PathProgramCache]: Analyzing trace with hash -193744714, now seen corresponding path program 1 times [2019-11-28 00:24:00,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:00,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936947657] [2019-11-28 00:24:00,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 00:24:00,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936947657] [2019-11-28 00:24:00,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716358103] [2019-11-28 00:24:00,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:00,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:24:00,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 00:24:00,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:00,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-11-28 00:24:00,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449687735] [2019-11-28 00:24:00,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:24:00,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:00,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:24:00,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:24:00,529 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 10 states. [2019-11-28 00:24:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:00,838 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2019-11-28 00:24:00,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:24:00,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-28 00:24:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:00,841 INFO L225 Difference]: With dead ends: 47 [2019-11-28 00:24:00,843 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 00:24:00,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:24:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 00:24:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-11-28 00:24:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 00:24:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-11-28 00:24:00,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 24 [2019-11-28 00:24:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:00,865 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-28 00:24:00,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:24:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-11-28 00:24:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:24:00,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:00,872 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:01,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:01,077 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:01,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:01,077 INFO L82 PathProgramCache]: Analyzing trace with hash 416247163, now seen corresponding path program 1 times [2019-11-28 00:24:01,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:01,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368449007] [2019-11-28 00:24:01,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 00:24:01,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368449007] [2019-11-28 00:24:01,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609326718] [2019-11-28 00:24:01,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 00:24:01,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 00:24:01,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:01,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-28 00:24:01,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759217474] [2019-11-28 00:24:01,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:24:01,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:01,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:24:01,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:24:01,469 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 14 states. [2019-11-28 00:24:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:02,094 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2019-11-28 00:24:02,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 00:24:02,095 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-28 00:24:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:02,101 INFO L225 Difference]: With dead ends: 50 [2019-11-28 00:24:02,102 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 00:24:02,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:24:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 00:24:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2019-11-28 00:24:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 00:24:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2019-11-28 00:24:02,124 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 49 transitions. Word has length 31 [2019-11-28 00:24:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:02,125 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 49 transitions. [2019-11-28 00:24:02,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:24:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2019-11-28 00:24:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 00:24:02,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:02,127 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:02,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:02,332 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash -781004688, now seen corresponding path program 2 times [2019-11-28 00:24:02,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:02,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258046298] [2019-11-28 00:24:02,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 00:24:02,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258046298] [2019-11-28 00:24:02,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298251346] [2019-11-28 00:24:02,562 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:02,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:24:02,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:02,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:24:02,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 00:24:02,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:02,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2019-11-28 00:24:02,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419842187] [2019-11-28 00:24:02,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 00:24:02,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:02,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 00:24:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:24:02,675 INFO L87 Difference]: Start difference. First operand 32 states and 49 transitions. Second operand 15 states. [2019-11-28 00:24:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:03,175 INFO L93 Difference]: Finished difference Result 61 states and 112 transitions. [2019-11-28 00:24:03,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:24:03,176 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-11-28 00:24:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:03,179 INFO L225 Difference]: With dead ends: 61 [2019-11-28 00:24:03,179 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 00:24:03,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-11-28 00:24:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 00:24:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2019-11-28 00:24:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 00:24:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-11-28 00:24:03,196 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 38 [2019-11-28 00:24:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:03,197 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-11-28 00:24:03,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 00:24:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-11-28 00:24:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 00:24:03,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:03,199 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:03,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:03,409 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:03,410 INFO L82 PathProgramCache]: Analyzing trace with hash 947442768, now seen corresponding path program 3 times [2019-11-28 00:24:03,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:03,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109264814] [2019-11-28 00:24:03,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 00:24:03,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109264814] [2019-11-28 00:24:03,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667283161] [2019-11-28 00:24:03,696 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:03,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 00:24:03,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:03,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:24:03,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 00:24:03,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:03,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2019-11-28 00:24:03,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253391393] [2019-11-28 00:24:03,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 00:24:03,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:03,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 00:24:03,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:24:03,885 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 21 states. [2019-11-28 00:24:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:04,380 INFO L93 Difference]: Finished difference Result 80 states and 152 transitions. [2019-11-28 00:24:04,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:24:04,381 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-11-28 00:24:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:04,383 INFO L225 Difference]: With dead ends: 80 [2019-11-28 00:24:04,383 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 00:24:04,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-11-28 00:24:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 00:24:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2019-11-28 00:24:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 00:24:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2019-11-28 00:24:04,396 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 71 transitions. Word has length 38 [2019-11-28 00:24:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:04,397 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 71 transitions. [2019-11-28 00:24:04,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 00:24:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 71 transitions. [2019-11-28 00:24:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 00:24:04,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:04,400 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:04,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:04,604 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:04,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2112206418, now seen corresponding path program 4 times [2019-11-28 00:24:04,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:04,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285713022] [2019-11-28 00:24:04,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 63 proven. 57 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-28 00:24:05,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285713022] [2019-11-28 00:24:05,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163270578] [2019-11-28 00:24:05,014 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:05,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:24:05,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:05,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:24:05,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 86 proven. 35 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-28 00:24:05,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:05,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 26 [2019-11-28 00:24:05,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108061441] [2019-11-28 00:24:05,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 00:24:05,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:05,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 00:24:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:24:05,214 INFO L87 Difference]: Start difference. First operand 42 states and 71 transitions. Second operand 26 states. [2019-11-28 00:24:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:06,791 INFO L93 Difference]: Finished difference Result 147 states and 385 transitions. [2019-11-28 00:24:06,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-28 00:24:06,797 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64 [2019-11-28 00:24:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:06,801 INFO L225 Difference]: With dead ends: 147 [2019-11-28 00:24:06,801 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 00:24:06,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=528, Invalid=2124, Unknown=0, NotChecked=0, Total=2652 [2019-11-28 00:24:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 00:24:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-11-28 00:24:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 00:24:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 182 transitions. [2019-11-28 00:24:06,828 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 182 transitions. Word has length 64 [2019-11-28 00:24:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:06,828 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 182 transitions. [2019-11-28 00:24:06,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 00:24:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 182 transitions. [2019-11-28 00:24:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-28 00:24:06,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:06,835 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 10, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:07,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:07,039 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:07,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:07,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2068462442, now seen corresponding path program 5 times [2019-11-28 00:24:07,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:07,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213089177] [2019-11-28 00:24:07,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 230 proven. 184 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-11-28 00:24:07,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213089177] [2019-11-28 00:24:07,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291331538] [2019-11-28 00:24:07,586 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:07,679 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-28 00:24:07,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:07,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 00:24:07,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 333 proven. 114 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-11-28 00:24:07,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:07,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 24 [2019-11-28 00:24:07,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552583347] [2019-11-28 00:24:07,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 00:24:07,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:07,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 00:24:07,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:24:07,795 INFO L87 Difference]: Start difference. First operand 90 states and 182 transitions. Second operand 24 states. [2019-11-28 00:24:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:08,989 INFO L93 Difference]: Finished difference Result 224 states and 654 transitions. [2019-11-28 00:24:08,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-28 00:24:08,990 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 117 [2019-11-28 00:24:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:08,991 INFO L225 Difference]: With dead ends: 224 [2019-11-28 00:24:08,991 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:24:08,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=533, Invalid=2437, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 00:24:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:24:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:24:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:24:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:24:08,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2019-11-28 00:24:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:08,996 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:24:08,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 00:24:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:24:08,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:24:09,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:09,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:24:10,206 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 25 [2019-11-28 00:24:10,293 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:24:10,293 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:24:10,293 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:24:10,293 INFO L246 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2019-11-28 00:24:10,293 INFO L249 CegarLoopResult]: At program point L26(lines 26 46) the Hoare annotation is: true [2019-11-28 00:24:10,294 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-11-28 00:24:10,294 INFO L246 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2019-11-28 00:24:10,294 INFO L246 CegarLoopResult]: For program point L41(lines 41 45) no Hoare annotation was computed. [2019-11-28 00:24:10,294 INFO L242 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~n~0) [2019-11-28 00:24:10,294 INFO L246 CegarLoopResult]: For program point L40-1(line 40) no Hoare annotation was computed. [2019-11-28 00:24:10,294 INFO L246 CegarLoopResult]: For program point L34(lines 34 39) no Hoare annotation was computed. [2019-11-28 00:24:10,294 INFO L246 CegarLoopResult]: For program point ackermannEXIT(lines 15 23) no Hoare annotation was computed. [2019-11-28 00:24:10,295 INFO L242 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= ackermann_~m 0))) [2019-11-28 00:24:10,295 INFO L249 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2019-11-28 00:24:10,295 INFO L246 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-11-28 00:24:10,295 INFO L242 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= ackermann_~m 0))) [2019-11-28 00:24:10,295 INFO L242 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse1 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (not (= ackermann_~m 0)))) (let ((.cse0 (and (<= 3 |ackermann_#t~ret1|) .cse1 .cse2 .cse3))) (and (<= 0 |ackermann_#in~m|) (not (<= |ackermann_#in~n| 0)) (or .cse0 (and .cse1 .cse2 (<= |ackermann_#in~m| 1) .cse3 (<= 2 |ackermann_#t~ret1|))) (or (<= |ackermann_#in~n| 1) .cse0)))) [2019-11-28 00:24:10,295 INFO L246 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2019-11-28 00:24:10,295 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 00:24:10,296 INFO L246 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2019-11-28 00:24:10,297 INFO L246 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2019-11-28 00:24:10,297 INFO L246 CegarLoopResult]: For program point ackermannFINAL(lines 15 23) no Hoare annotation was computed. [2019-11-28 00:24:10,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:24:10 BoogieIcfgContainer [2019-11-28 00:24:10,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:24:10,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:24:10,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:24:10,308 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:24:10,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:23:59" (3/4) ... [2019-11-28 00:24:10,312 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:24:10,319 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2019-11-28 00:24:10,324 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:24:10,325 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:24:10,379 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:24:10,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:24:10,384 INFO L168 Benchmark]: Toolchain (without parser) took 11784.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.3 MB). Free memory was 960.4 MB in the beginning and 959.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 309.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:10,385 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:10,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.44 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:10,387 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:10,388 INFO L168 Benchmark]: Boogie Preprocessor took 22.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:10,388 INFO L168 Benchmark]: RCFGBuilder took 252.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:10,392 INFO L168 Benchmark]: TraceAbstraction took 11103.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 959.3 MB in the end (delta: 161.8 MB). Peak memory consumption was 325.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:10,392 INFO L168 Benchmark]: Witness Printer took 71.74 ms. Allocated memory is still 1.3 GB. Free memory is still 959.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:10,399 INFO L335 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.44 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 84.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11103.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 959.3 MB in the end (delta: 161.8 MB). Peak memory consumption was 325.4 MB. Max. memory is 11.5 GB. * Witness Printer took 71.74 ms. Allocated memory is still 1.3 GB. Free memory is still 959.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Result: SAFE, OverallTime: 9.8s, OverallIterations: 8, TraceHistogramMax: 17, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 145 SDtfs, 330 SDslu, 779 SDs, 0 SdLazy, 2756 SolverSat, 690 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 77 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 234 PreInvPairs, 377 NumberOfFragments, 88 HoareAnnotationTreeSize, 234 FomulaSimplifications, 52561 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 6 FomulaSimplificationsInter, 2314 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 653 NumberOfCodeBlocks, 601 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 95043 SizeOfPredicates, 26 NumberOfNonLiveVariables, 785 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 1472/1916 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...