./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/ssh-simplified/s3_srvr_1a.cil.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 d8f19e5f85495da246f7b055515ad1966fa98828 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:40:13,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:13,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:13,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:13,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:13,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:13,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:13,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:13,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:13,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:13,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:13,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:13,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:13,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:13,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:13,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:13,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:13,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:13,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:13,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:13,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:13,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:13,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:13,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:13,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:13,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:13,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:13,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:13,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:13,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:13,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:13,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:13,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:13,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:13,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:13,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:13,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:13,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:13,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:13,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:13,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:13,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:40:13,693 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:13,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:13,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:13,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:13,695 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:13,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:13,696 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:13,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:13,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:13,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:13,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:13,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:13,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:13,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:13,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:13,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:13,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:13,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:13,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:13,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:13,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:13,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:13,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:13,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:13,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:13,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:13,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:13,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:13,702 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:13,702 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 -> d8f19e5f85495da246f7b055515ad1966fa98828 [2019-11-28 15:40:14,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:14,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:14,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:14,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:14,061 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:14,062 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c [2019-11-28 15:40:14,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a28e6f/0ecc7f01dd214510933199828f07caa8/FLAG0d84f0428 [2019-11-28 15:40:14,585 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:14,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c [2019-11-28 15:40:14,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a28e6f/0ecc7f01dd214510933199828f07caa8/FLAG0d84f0428 [2019-11-28 15:40:14,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a28e6f/0ecc7f01dd214510933199828f07caa8 [2019-11-28 15:40:15,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:15,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:15,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:15,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:15,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:15,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245d122c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15, skipping insertion in model container [2019-11-28 15:40:15,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:15,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:15,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:15,276 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:15,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:15,377 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:15,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15 WrapperNode [2019-11-28 15:40:15,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:15,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:15,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:15,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:15,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:15,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:15,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:15,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:15,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (1/1) ... [2019-11-28 15:40:15,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:15,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:15,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:15,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:15,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (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 15:40:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:15,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:15,868 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:15,868 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 15:40:15,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:15 BoogieIcfgContainer [2019-11-28 15:40:15,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:15,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:15,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:15,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:15,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:15" (1/3) ... [2019-11-28 15:40:15,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf46f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:15, skipping insertion in model container [2019-11-28 15:40:15,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:15" (2/3) ... [2019-11-28 15:40:15,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf46f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:15, skipping insertion in model container [2019-11-28 15:40:15,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:15" (3/3) ... [2019-11-28 15:40:15,889 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2019-11-28 15:40:15,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:15,910 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:15,932 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:15,957 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:15,958 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:15,958 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:15,958 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:15,958 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:15,959 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:15,959 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:15,959 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-28 15:40:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-28 15:40:15,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-28 15:40:15,981 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,986 INFO L82 PathProgramCache]: Analyzing trace with hash 963516, now seen corresponding path program 1 times [2019-11-28 15:40:15,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837629980] [2019-11-28 15:40:15,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,146 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 15:40:16,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837629980] [2019-11-28 15:40:16,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270925211] [2019-11-28 15:40:16,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,180 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-11-28 15:40:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,364 INFO L93 Difference]: Finished difference Result 131 states and 218 transitions. [2019-11-28 15:40:16,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-28 15:40:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,388 INFO L225 Difference]: With dead ends: 131 [2019-11-28 15:40:16,389 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 15:40:16,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 15:40:16,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-28 15:40:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 15:40:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2019-11-28 15:40:16,462 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 4 [2019-11-28 15:40:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,463 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2019-11-28 15:40:16,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2019-11-28 15:40:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 15:40:16,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,464 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,465 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,465 INFO L82 PathProgramCache]: Analyzing trace with hash -737314741, now seen corresponding path program 1 times [2019-11-28 15:40:16,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118909611] [2019-11-28 15:40:16,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:16,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118909611] [2019-11-28 15:40:16,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:16,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719696915] [2019-11-28 15:40:16,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,497 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand 3 states. [2019-11-28 15:40:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,605 INFO L93 Difference]: Finished difference Result 157 states and 249 transitions. [2019-11-28 15:40:16,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 15:40:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,608 INFO L225 Difference]: With dead ends: 157 [2019-11-28 15:40:16,608 INFO L226 Difference]: Without dead ends: 117 [2019-11-28 15:40:16,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-28 15:40:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-11-28 15:40:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 15:40:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2019-11-28 15:40:16,630 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 9 [2019-11-28 15:40:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,630 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2019-11-28 15:40:16,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2019-11-28 15:40:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:16,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,632 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,632 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,633 INFO L82 PathProgramCache]: Analyzing trace with hash -407668003, now seen corresponding path program 1 times [2019-11-28 15:40:16,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099467322] [2019-11-28 15:40:16,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:40:16,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099467322] [2019-11-28 15:40:16,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:16,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773211501] [2019-11-28 15:40:16,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,685 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand 3 states. [2019-11-28 15:40:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,781 INFO L93 Difference]: Finished difference Result 233 states and 365 transitions. [2019-11-28 15:40:16,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,790 INFO L225 Difference]: With dead ends: 233 [2019-11-28 15:40:16,790 INFO L226 Difference]: Without dead ends: 155 [2019-11-28 15:40:16,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-28 15:40:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-28 15:40:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-28 15:40:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2019-11-28 15:40:16,827 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 15 [2019-11-28 15:40:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,828 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2019-11-28 15:40:16,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2019-11-28 15:40:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 15:40:16,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,830 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,830 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1622407343, now seen corresponding path program 1 times [2019-11-28 15:40:16,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886099111] [2019-11-28 15:40:16,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 15:40:16,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886099111] [2019-11-28 15:40:16,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:16,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334800260] [2019-11-28 15:40:16,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,887 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand 3 states. [2019-11-28 15:40:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,057 INFO L93 Difference]: Finished difference Result 367 states and 579 transitions. [2019-11-28 15:40:17,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 15:40:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,060 INFO L225 Difference]: With dead ends: 367 [2019-11-28 15:40:17,061 INFO L226 Difference]: Without dead ends: 213 [2019-11-28 15:40:17,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-28 15:40:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2019-11-28 15:40:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-28 15:40:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 291 transitions. [2019-11-28 15:40:17,085 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 291 transitions. Word has length 30 [2019-11-28 15:40:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,086 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 291 transitions. [2019-11-28 15:40:17,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 291 transitions. [2019-11-28 15:40:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 15:40:17,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,089 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,090 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2042852816, now seen corresponding path program 1 times [2019-11-28 15:40:17,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207342171] [2019-11-28 15:40:17,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 15:40:17,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207342171] [2019-11-28 15:40:17,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:17,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857481145] [2019-11-28 15:40:17,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,177 INFO L87 Difference]: Start difference. First operand 207 states and 291 transitions. Second operand 3 states. [2019-11-28 15:40:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,240 INFO L93 Difference]: Finished difference Result 415 states and 588 transitions. [2019-11-28 15:40:17,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 15:40:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,243 INFO L225 Difference]: With dead ends: 415 [2019-11-28 15:40:17,243 INFO L226 Difference]: Without dead ends: 260 [2019-11-28 15:40:17,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-28 15:40:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-11-28 15:40:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-28 15:40:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 365 transitions. [2019-11-28 15:40:17,286 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 365 transitions. Word has length 44 [2019-11-28 15:40:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,288 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 365 transitions. [2019-11-28 15:40:17,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 365 transitions. [2019-11-28 15:40:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 15:40:17,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,298 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,298 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1056783528, now seen corresponding path program 1 times [2019-11-28 15:40:17,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230463525] [2019-11-28 15:40:17,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 15:40:17,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230463525] [2019-11-28 15:40:17,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:17,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751328274] [2019-11-28 15:40:17,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,381 INFO L87 Difference]: Start difference. First operand 258 states and 365 transitions. Second operand 3 states. [2019-11-28 15:40:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,499 INFO L93 Difference]: Finished difference Result 523 states and 752 transitions. [2019-11-28 15:40:17,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-28 15:40:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,503 INFO L225 Difference]: With dead ends: 523 [2019-11-28 15:40:17,503 INFO L226 Difference]: Without dead ends: 188 [2019-11-28 15:40:17,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-28 15:40:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2019-11-28 15:40:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-28 15:40:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 244 transitions. [2019-11-28 15:40:17,532 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 244 transitions. Word has length 47 [2019-11-28 15:40:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,535 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 244 transitions. [2019-11-28 15:40:17,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 244 transitions. [2019-11-28 15:40:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 15:40:17,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,547 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,549 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,553 INFO L82 PathProgramCache]: Analyzing trace with hash -439474765, now seen corresponding path program 1 times [2019-11-28 15:40:17,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312049165] [2019-11-28 15:40:17,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 15:40:17,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312049165] [2019-11-28 15:40:17,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:17,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253798361] [2019-11-28 15:40:17,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,679 INFO L87 Difference]: Start difference. First operand 185 states and 244 transitions. Second operand 3 states. [2019-11-28 15:40:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,698 INFO L93 Difference]: Finished difference Result 306 states and 375 transitions. [2019-11-28 15:40:17,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-28 15:40:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,700 INFO L225 Difference]: With dead ends: 306 [2019-11-28 15:40:17,700 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:17,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:17,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-11-28 15:40:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,703 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:17,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:17,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:17,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:17,987 INFO L246 CegarLoopResult]: For program point L60(lines 60 189) no Hoare annotation was computed. [2019-11-28 15:40:17,988 INFO L246 CegarLoopResult]: For program point L151-1(lines 74 183) no Hoare annotation was computed. [2019-11-28 15:40:17,988 INFO L246 CegarLoopResult]: For program point L52(lines 52 193) no Hoare annotation was computed. [2019-11-28 15:40:17,988 INFO L246 CegarLoopResult]: For program point L85-1(lines 74 183) no Hoare annotation was computed. [2019-11-28 15:40:17,989 INFO L242 CegarLoopResult]: At program point L176(lines 22 211) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~blastFlag~0 3))) (or (and .cse0 (<= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0))) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (<= 8672 ULTIMATE.start_main_~s__state~0) .cse0))) [2019-11-28 15:40:17,989 INFO L246 CegarLoopResult]: For program point L44(lines 44 197) no Hoare annotation was computed. [2019-11-28 15:40:17,989 INFO L246 CegarLoopResult]: For program point L135(lines 135 139) no Hoare annotation was computed. [2019-11-28 15:40:17,989 INFO L242 CegarLoopResult]: At program point L69(lines 68 185) the Hoare annotation is: (let ((.cse0 (<= 8640 ULTIMATE.start_main_~s__state~0))) (or (and (<= ULTIMATE.start_main_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_main_~blastFlag~0 3) .cse0 (not (= ULTIMATE.start_main_~s__hit~0 0))))) [2019-11-28 15:40:17,989 INFO L246 CegarLoopResult]: For program point L36(lines 36 201) no Hoare annotation was computed. [2019-11-28 15:40:17,989 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:17,990 INFO L242 CegarLoopResult]: At program point L61(lines 60 189) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,990 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:17,990 INFO L242 CegarLoopResult]: At program point L53(lines 52 193) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,990 INFO L242 CegarLoopResult]: At program point L45(lines 44 197) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,990 INFO L246 CegarLoopResult]: For program point L78-1(lines 78 80) no Hoare annotation was computed. [2019-11-28 15:40:17,990 INFO L246 CegarLoopResult]: For program point L169-1(lines 74 183) no Hoare annotation was computed. [2019-11-28 15:40:17,992 INFO L242 CegarLoopResult]: At program point L37(lines 36 201) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,992 INFO L246 CegarLoopResult]: For program point L29(lines 29 204) no Hoare annotation was computed. [2019-11-28 15:40:17,993 INFO L242 CegarLoopResult]: At program point L120(lines 113 122) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,993 INFO L242 CegarLoopResult]: At program point L112(lines 105 123) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,994 INFO L246 CegarLoopResult]: For program point L162-1(lines 162 164) no Hoare annotation was computed. [2019-11-28 15:40:17,994 INFO L242 CegarLoopResult]: At program point L30(lines 29 204) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,994 INFO L246 CegarLoopResult]: For program point L105(lines 105 123) no Hoare annotation was computed. [2019-11-28 15:40:17,994 INFO L246 CegarLoopResult]: For program point L72(lines 72 183) no Hoare annotation was computed. [2019-11-28 15:40:17,994 INFO L246 CegarLoopResult]: For program point L64(lines 64 187) no Hoare annotation was computed. [2019-11-28 15:40:17,995 INFO L246 CegarLoopResult]: For program point L56(lines 56 191) no Hoare annotation was computed. [2019-11-28 15:40:17,995 INFO L246 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2019-11-28 15:40:17,995 INFO L249 CegarLoopResult]: At program point L213(lines 8 217) the Hoare annotation is: true [2019-11-28 15:40:17,995 INFO L246 CegarLoopResult]: For program point L114(lines 114 118) no Hoare annotation was computed. [2019-11-28 15:40:17,995 INFO L246 CegarLoopResult]: For program point L48(lines 48 195) no Hoare annotation was computed. [2019-11-28 15:40:17,996 INFO L246 CegarLoopResult]: For program point L172(lines 172 174) no Hoare annotation was computed. [2019-11-28 15:40:17,996 INFO L246 CegarLoopResult]: For program point L106(lines 106 110) no Hoare annotation was computed. [2019-11-28 15:40:17,997 INFO L242 CegarLoopResult]: At program point L73(lines 72 183) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_main_~s__state~0) (<= ULTIMATE.start_main_~blastFlag~0 3)) [2019-11-28 15:40:17,997 INFO L246 CegarLoopResult]: For program point L40(lines 40 199) no Hoare annotation was computed. [2019-11-28 15:40:17,998 INFO L242 CegarLoopResult]: At program point L65(lines 64 187) the Hoare annotation is: (let ((.cse0 (<= 8640 ULTIMATE.start_main_~s__state~0))) (or (and (<= ULTIMATE.start_main_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_main_~blastFlag~0 3) .cse0 (not (= ULTIMATE.start_main_~s__hit~0 0))))) [2019-11-28 15:40:17,998 INFO L246 CegarLoopResult]: For program point L32(lines 32 203) no Hoare annotation was computed. [2019-11-28 15:40:17,998 INFO L242 CegarLoopResult]: At program point L57(lines 56 191) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,998 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 215) no Hoare annotation was computed. [2019-11-28 15:40:17,999 INFO L242 CegarLoopResult]: At program point L49(lines 48 195) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,999 INFO L242 CegarLoopResult]: At program point L173(lines 8 217) the Hoare annotation is: false [2019-11-28 15:40:17,999 INFO L242 CegarLoopResult]: At program point L41(lines 40 199) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,999 INFO L242 CegarLoopResult]: At program point L33(lines 32 203) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-28 15:40:17,999 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:18,000 INFO L249 CegarLoopResult]: At program point L216(lines 8 217) the Hoare annotation is: true [2019-11-28 15:40:18,000 INFO L246 CegarLoopResult]: For program point L68(lines 68 185) no Hoare annotation was computed. [2019-11-28 15:40:18,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:18 BoogieIcfgContainer [2019-11-28 15:40:18,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:18,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:18,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:18,037 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:18,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:15" (3/4) ... [2019-11-28 15:40:18,043 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:18,065 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 15:40:18,066 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:18,191 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:18,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:18,194 INFO L168 Benchmark]: Toolchain (without parser) took 3189.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 957.7 MB in the beginning and 920.9 MB in the end (delta: 36.8 MB). Peak memory consumption was 161.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:18,195 INFO L168 Benchmark]: CDTParser took 0.36 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 15:40:18,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:18,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.39 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. [2019-11-28 15:40:18,196 INFO L168 Benchmark]: Boogie Preprocessor took 24.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:18,197 INFO L168 Benchmark]: RCFGBuilder took 427.73 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:18,197 INFO L168 Benchmark]: TraceAbstraction took 2160.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 927.6 MB in the end (delta: 155.5 MB). Peak memory consumption was 155.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:18,198 INFO L168 Benchmark]: Witness Printer took 154.82 ms. Allocated memory is still 1.2 GB. Free memory was 927.6 MB in the beginning and 920.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:18,200 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.36 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 372.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.39 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. * Boogie Preprocessor took 24.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 427.73 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2160.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 927.6 MB in the end (delta: 155.5 MB). Peak memory consumption was 155.5 MB. Max. memory is 11.5 GB. * Witness Printer took 154.82 ms. Allocated memory is still 1.2 GB. Free memory was 927.6 MB in the beginning and 920.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 215]: 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: 36]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8640 <= s__state) || ((blastFlag <= 3 && 8640 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8640 <= s__state) && !(s__hit == 0)) || blastFlag <= 2) || (8672 <= s__state && blastFlag <= 3) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 8672 <= s__state && blastFlag <= 3 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8640 <= s__state) || ((blastFlag <= 3 && 8640 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: blastFlag <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 7, TraceHistogramMax: 6, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 427 SDtfs, 251 SDslu, 292 SDs, 0 SdLazy, 196 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=5, 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, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 85 NumberOfFragments, 103 HoareAnnotationTreeSize, 18 FomulaSimplifications, 585 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 22669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 202/202 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...