./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 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/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.24-30f4e4a [2019-11-27 22:35:44,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:44,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:44,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:44,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:44,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:44,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:44,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:44,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:44,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:44,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:44,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:44,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:44,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:44,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:44,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:44,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:44,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:44,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:44,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:44,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:44,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:44,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:44,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:44,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:44,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:44,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:44,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:44,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:44,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:44,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:44,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:44,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:44,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:44,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:44,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:44,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:44,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:44,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:44,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:44,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:44,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:44,253 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:44,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:44,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:44,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:44,257 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:44,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:44,257 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:44,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:44,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:44,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:44,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:44,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:44,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:44,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:44,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:44,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:44,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:44,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:44,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:44,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:44,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:44,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:44,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:44,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:44,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:44,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:44,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:44,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:44,265 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-27 22:35:44,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:44,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:44,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:44,597 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:44,598 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:44,599 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-27 22:35:44,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae12145b/4b47421648f746518b9ff21a413a787b/FLAG01682a681 [2019-11-27 22:35:45,089 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:45,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c [2019-11-27 22:35:45,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae12145b/4b47421648f746518b9ff21a413a787b/FLAG01682a681 [2019-11-27 22:35:45,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae12145b/4b47421648f746518b9ff21a413a787b [2019-11-27 22:35:45,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:45,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:45,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:45,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:45,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:45,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef7198d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45, skipping insertion in model container [2019-11-27 22:35:45,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:45,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:45,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:45,769 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:45,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:45,810 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:45,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45 WrapperNode [2019-11-27 22:35:45,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:45,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:45,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:45,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:45,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:45,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:45,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:45,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:45,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (1/1) ... [2019-11-27 22:35:45,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:45,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:45,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:45,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:45,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (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-27 22:35:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:46,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:46,424 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:46,424 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-27 22:35:46,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:46 BoogieIcfgContainer [2019-11-27 22:35:46,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:46,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:46,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:46,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:46,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:45" (1/3) ... [2019-11-27 22:35:46,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379b481c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:46, skipping insertion in model container [2019-11-27 22:35:46,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:45" (2/3) ... [2019-11-27 22:35:46,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379b481c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:46, skipping insertion in model container [2019-11-27 22:35:46,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:46" (3/3) ... [2019-11-27 22:35:46,459 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2019-11-27 22:35:46,482 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:46,500 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:46,519 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:46,557 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:46,558 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:46,558 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:46,559 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:46,559 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:46,560 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:46,561 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:46,562 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-27 22:35:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-27 22:35:46,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-27 22:35:46,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,602 INFO L82 PathProgramCache]: Analyzing trace with hash 963516, now seen corresponding path program 1 times [2019-11-27 22:35:46,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218965199] [2019-11-27 22:35:46,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,811 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-27 22:35:46,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218965199] [2019-11-27 22:35:46,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538271780] [2019-11-27 22:35:46,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,839 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-11-27 22:35:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,966 INFO L93 Difference]: Finished difference Result 131 states and 218 transitions. [2019-11-27 22:35:46,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-27 22:35:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,981 INFO L225 Difference]: With dead ends: 131 [2019-11-27 22:35:46,982 INFO L226 Difference]: Without dead ends: 79 [2019-11-27 22:35:46,985 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-27 22:35:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-27 22:35:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-27 22:35:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-27 22:35:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2019-11-27 22:35:47,043 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 4 [2019-11-27 22:35:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,044 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2019-11-27 22:35:47,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2019-11-27 22:35:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 22:35:47,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,046 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:47,047 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,048 INFO L82 PathProgramCache]: Analyzing trace with hash -737314741, now seen corresponding path program 1 times [2019-11-27 22:35:47,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934404068] [2019-11-27 22:35:47,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,085 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-27 22:35:47,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934404068] [2019-11-27 22:35:47,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:47,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916528060] [2019-11-27 22:35:47,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,089 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand 3 states. [2019-11-27 22:35:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,165 INFO L93 Difference]: Finished difference Result 157 states and 249 transitions. [2019-11-27 22:35:47,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-27 22:35:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,169 INFO L225 Difference]: With dead ends: 157 [2019-11-27 22:35:47,169 INFO L226 Difference]: Without dead ends: 117 [2019-11-27 22:35:47,170 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-27 22:35:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-27 22:35:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-11-27 22:35:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-27 22:35:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2019-11-27 22:35:47,190 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 9 [2019-11-27 22:35:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,190 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2019-11-27 22:35:47,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2019-11-27 22:35:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:35:47,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,193 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:47,193 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,194 INFO L82 PathProgramCache]: Analyzing trace with hash -407668003, now seen corresponding path program 1 times [2019-11-27 22:35:47,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686624773] [2019-11-27 22:35:47,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,225 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-27 22:35:47,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686624773] [2019-11-27 22:35:47,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:47,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333110383] [2019-11-27 22:35:47,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,229 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand 3 states. [2019-11-27 22:35:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,330 INFO L93 Difference]: Finished difference Result 233 states and 365 transitions. [2019-11-27 22:35:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:35:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,333 INFO L225 Difference]: With dead ends: 233 [2019-11-27 22:35:47,334 INFO L226 Difference]: Without dead ends: 155 [2019-11-27 22:35:47,335 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-27 22:35:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-27 22:35:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-27 22:35:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-27 22:35:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2019-11-27 22:35:47,357 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 15 [2019-11-27 22:35:47,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,358 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2019-11-27 22:35:47,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2019-11-27 22:35:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 22:35:47,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,361 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-27 22:35:47,361 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1622407343, now seen corresponding path program 1 times [2019-11-27 22:35:47,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205828296] [2019-11-27 22:35:47,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,416 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-27 22:35:47,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205828296] [2019-11-27 22:35:47,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:47,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794211210] [2019-11-27 22:35:47,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,426 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand 3 states. [2019-11-27 22:35:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,616 INFO L93 Difference]: Finished difference Result 367 states and 579 transitions. [2019-11-27 22:35:47,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-27 22:35:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,620 INFO L225 Difference]: With dead ends: 367 [2019-11-27 22:35:47,621 INFO L226 Difference]: Without dead ends: 213 [2019-11-27 22:35:47,622 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-27 22:35:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-27 22:35:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2019-11-27 22:35:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-27 22:35:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 291 transitions. [2019-11-27 22:35:47,656 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 291 transitions. Word has length 30 [2019-11-27 22:35:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,657 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 291 transitions. [2019-11-27 22:35:47,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 291 transitions. [2019-11-27 22:35:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 22:35:47,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,666 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-27 22:35:47,669 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2042852816, now seen corresponding path program 1 times [2019-11-27 22:35:47,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073483543] [2019-11-27 22:35:47,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,746 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-27 22:35:47,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073483543] [2019-11-27 22:35:47,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:47,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965675712] [2019-11-27 22:35:47,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,749 INFO L87 Difference]: Start difference. First operand 207 states and 291 transitions. Second operand 3 states. [2019-11-27 22:35:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,821 INFO L93 Difference]: Finished difference Result 415 states and 588 transitions. [2019-11-27 22:35:47,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-27 22:35:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,824 INFO L225 Difference]: With dead ends: 415 [2019-11-27 22:35:47,824 INFO L226 Difference]: Without dead ends: 260 [2019-11-27 22:35:47,826 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-27 22:35:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-27 22:35:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-11-27 22:35:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-27 22:35:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 365 transitions. [2019-11-27 22:35:47,848 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 365 transitions. Word has length 44 [2019-11-27 22:35:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,849 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 365 transitions. [2019-11-27 22:35:47,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 365 transitions. [2019-11-27 22:35:47,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 22:35:47,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,852 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-27 22:35:47,852 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1056783528, now seen corresponding path program 1 times [2019-11-27 22:35:47,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594172895] [2019-11-27 22:35:47,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,916 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-27 22:35:47,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594172895] [2019-11-27 22:35:47,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:47,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142650550] [2019-11-27 22:35:47,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,921 INFO L87 Difference]: Start difference. First operand 258 states and 365 transitions. Second operand 3 states. [2019-11-27 22:35:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,036 INFO L93 Difference]: Finished difference Result 523 states and 752 transitions. [2019-11-27 22:35:48,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-27 22:35:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,039 INFO L225 Difference]: With dead ends: 523 [2019-11-27 22:35:48,040 INFO L226 Difference]: Without dead ends: 188 [2019-11-27 22:35:48,041 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-27 22:35:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-27 22:35:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2019-11-27 22:35:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-27 22:35:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 244 transitions. [2019-11-27 22:35:48,054 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 244 transitions. Word has length 47 [2019-11-27 22:35:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,055 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 244 transitions. [2019-11-27 22:35:48,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 244 transitions. [2019-11-27 22:35:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-27 22:35:48,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,058 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-27 22:35:48,058 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -439474765, now seen corresponding path program 1 times [2019-11-27 22:35:48,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546442310] [2019-11-27 22:35:48,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,138 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-27 22:35:48,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546442310] [2019-11-27 22:35:48,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:48,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663479672] [2019-11-27 22:35:48,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,146 INFO L87 Difference]: Start difference. First operand 185 states and 244 transitions. Second operand 3 states. [2019-11-27 22:35:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,163 INFO L93 Difference]: Finished difference Result 306 states and 375 transitions. [2019-11-27 22:35:48,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-27 22:35:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,164 INFO L225 Difference]: With dead ends: 306 [2019-11-27 22:35:48,164 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:35:48,165 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-27 22:35:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:35:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:35:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:35:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:35:48,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-11-27 22:35:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,168 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:35:48,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:35:48,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:35:48,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:35:48,463 INFO L246 CegarLoopResult]: For program point L60(lines 60 189) no Hoare annotation was computed. [2019-11-27 22:35:48,463 INFO L246 CegarLoopResult]: For program point L151-1(lines 74 183) no Hoare annotation was computed. [2019-11-27 22:35:48,464 INFO L246 CegarLoopResult]: For program point L52(lines 52 193) no Hoare annotation was computed. [2019-11-27 22:35:48,464 INFO L246 CegarLoopResult]: For program point L85-1(lines 74 183) no Hoare annotation was computed. [2019-11-27 22:35:48,464 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-27 22:35:48,465 INFO L246 CegarLoopResult]: For program point L44(lines 44 197) no Hoare annotation was computed. [2019-11-27 22:35:48,465 INFO L246 CegarLoopResult]: For program point L135(lines 135 139) no Hoare annotation was computed. [2019-11-27 22:35:48,466 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-27 22:35:48,466 INFO L246 CegarLoopResult]: For program point L36(lines 36 201) no Hoare annotation was computed. [2019-11-27 22:35:48,466 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:35:48,466 INFO L242 CegarLoopResult]: At program point L61(lines 60 189) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,466 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:35:48,467 INFO L242 CegarLoopResult]: At program point L53(lines 52 193) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,467 INFO L242 CegarLoopResult]: At program point L45(lines 44 197) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,467 INFO L246 CegarLoopResult]: For program point L78-1(lines 78 80) no Hoare annotation was computed. [2019-11-27 22:35:48,468 INFO L246 CegarLoopResult]: For program point L169-1(lines 74 183) no Hoare annotation was computed. [2019-11-27 22:35:48,468 INFO L242 CegarLoopResult]: At program point L37(lines 36 201) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,468 INFO L246 CegarLoopResult]: For program point L29(lines 29 204) no Hoare annotation was computed. [2019-11-27 22:35:48,468 INFO L242 CegarLoopResult]: At program point L120(lines 113 122) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,469 INFO L242 CegarLoopResult]: At program point L112(lines 105 123) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,469 INFO L246 CegarLoopResult]: For program point L162-1(lines 162 164) no Hoare annotation was computed. [2019-11-27 22:35:48,469 INFO L242 CegarLoopResult]: At program point L30(lines 29 204) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,469 INFO L246 CegarLoopResult]: For program point L105(lines 105 123) no Hoare annotation was computed. [2019-11-27 22:35:48,470 INFO L246 CegarLoopResult]: For program point L72(lines 72 183) no Hoare annotation was computed. [2019-11-27 22:35:48,470 INFO L246 CegarLoopResult]: For program point L64(lines 64 187) no Hoare annotation was computed. [2019-11-27 22:35:48,470 INFO L246 CegarLoopResult]: For program point L56(lines 56 191) no Hoare annotation was computed. [2019-11-27 22:35:48,471 INFO L246 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2019-11-27 22:35:48,471 INFO L249 CegarLoopResult]: At program point L213(lines 8 217) the Hoare annotation is: true [2019-11-27 22:35:48,471 INFO L246 CegarLoopResult]: For program point L114(lines 114 118) no Hoare annotation was computed. [2019-11-27 22:35:48,471 INFO L246 CegarLoopResult]: For program point L48(lines 48 195) no Hoare annotation was computed. [2019-11-27 22:35:48,472 INFO L246 CegarLoopResult]: For program point L172(lines 172 174) no Hoare annotation was computed. [2019-11-27 22:35:48,472 INFO L246 CegarLoopResult]: For program point L106(lines 106 110) no Hoare annotation was computed. [2019-11-27 22:35:48,472 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-27 22:35:48,473 INFO L246 CegarLoopResult]: For program point L40(lines 40 199) no Hoare annotation was computed. [2019-11-27 22:35:48,473 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-27 22:35:48,473 INFO L246 CegarLoopResult]: For program point L32(lines 32 203) no Hoare annotation was computed. [2019-11-27 22:35:48,473 INFO L242 CegarLoopResult]: At program point L57(lines 56 191) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,474 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 215) no Hoare annotation was computed. [2019-11-27 22:35:48,474 INFO L242 CegarLoopResult]: At program point L49(lines 48 195) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,474 INFO L242 CegarLoopResult]: At program point L173(lines 8 217) the Hoare annotation is: false [2019-11-27 22:35:48,475 INFO L242 CegarLoopResult]: At program point L41(lines 40 199) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,475 INFO L242 CegarLoopResult]: At program point L33(lines 32 203) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-27 22:35:48,475 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:35:48,475 INFO L249 CegarLoopResult]: At program point L216(lines 8 217) the Hoare annotation is: true [2019-11-27 22:35:48,476 INFO L246 CegarLoopResult]: For program point L68(lines 68 185) no Hoare annotation was computed. [2019-11-27 22:35:48,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:48 BoogieIcfgContainer [2019-11-27 22:35:48,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:48,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:48,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:48,512 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:48,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:46" (3/4) ... [2019-11-27 22:35:48,517 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:35:48,535 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-27 22:35:48,536 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:35:48,643 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:48,644 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:48,646 INFO L168 Benchmark]: Toolchain (without parser) took 3118.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.3 MB in the beginning and 941.4 MB in the end (delta: 14.9 MB). Peak memory consumption was 154.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,647 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:48,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.85 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,648 INFO L168 Benchmark]: Boogie Preprocessor took 36.31 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-27 22:35:48,649 INFO L168 Benchmark]: RCFGBuilder took 486.91 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,649 INFO L168 Benchmark]: TraceAbstraction took 2073.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.1 MB in the end (delta: 162.0 MB). Peak memory consumption was 162.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,649 INFO L168 Benchmark]: Witness Printer took 132.57 ms. Allocated memory is still 1.2 GB. Free memory was 948.1 MB in the beginning and 941.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,652 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.85 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.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 99.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.31 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 486.91 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2073.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.1 MB in the end (delta: 162.0 MB). Peak memory consumption was 162.0 MB. Max. memory is 11.5 GB. * Witness Printer took 132.57 ms. Allocated memory is still 1.2 GB. Free memory was 948.1 MB in the beginning and 941.4 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.6s, OverallIterations: 7, TraceHistogramMax: 6, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 427 SDtfs, 251 SDslu, 292 SDs, 0 SdLazy, 196 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s 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...