./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer --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-678e011 [2019-11-20 00:16:41,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:16:41,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:16:41,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:16:41,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:16:41,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:16:41,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:16:41,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:16:41,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:16:41,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:16:41,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:16:41,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:16:41,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:16:41,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:16:41,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:16:41,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:16:41,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:16:41,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:16:41,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:16:41,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:16:41,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:16:41,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:16:41,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:16:41,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:16:41,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:16:41,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:16:41,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:16:41,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:16:41,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:16:41,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:16:41,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:16:41,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:16:41,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:16:41,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:16:41,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:16:41,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:16:41,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:16:41,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:16:41,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:16:41,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:16:41,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:16:41,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:16:41,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:16:41,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:16:41,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:16:41,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:16:41,669 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:16:41,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:16:41,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:16:41,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:16:41,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:16:41,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:16:41,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:16:41,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:16:41,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:16:41,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:16:41,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:16:41,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:16:41,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:16:41,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:16:41,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:16:41,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:16:41,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:16:41,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:16:41,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:16:41,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:16:41,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:16:41,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:16:41,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:16:41,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:16:41,673 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer 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-20 00:16:41,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:16:41,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:16:41,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:16:41,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:16:41,870 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:16:41,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c [2019-11-20 00:16:41,927 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/data/10bce7fd2/db55ff60199f45e8b11700c80cefbbcf/FLAG17ee64d9f [2019-11-20 00:16:42,319 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:16:42,322 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c [2019-11-20 00:16:42,332 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/data/10bce7fd2/db55ff60199f45e8b11700c80cefbbcf/FLAG17ee64d9f [2019-11-20 00:16:42,733 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/data/10bce7fd2/db55ff60199f45e8b11700c80cefbbcf [2019-11-20 00:16:42,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:16:42,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:16:42,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:16:42,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:16:42,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:16:42,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:16:42" (1/1) ... [2019-11-20 00:16:42,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a5dfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:42, skipping insertion in model container [2019-11-20 00:16:42,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:16:42" (1/1) ... [2019-11-20 00:16:42,756 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:16:42,783 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:16:43,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:16:43,007 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:16:43,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:16:43,060 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:16:43,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43 WrapperNode [2019-11-20 00:16:43,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:16:43,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:16:43,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:16:43,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:16:43,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (1/1) ... [2019-11-20 00:16:43,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (1/1) ... [2019-11-20 00:16:43,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:16:43,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:16:43,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:16:43,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:16:43,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (1/1) ... [2019-11-20 00:16:43,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (1/1) ... [2019-11-20 00:16:43,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (1/1) ... [2019-11-20 00:16:43,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (1/1) ... [2019-11-20 00:16:43,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (1/1) ... [2019-11-20 00:16:43,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (1/1) ... [2019-11-20 00:16:43,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (1/1) ... [2019-11-20 00:16:43,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:16:43,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:16:43,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:16:43,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:16:43,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/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-20 00:16:43,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:16:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:16:43,520 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:16:43,520 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-20 00:16:43,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:16:43 BoogieIcfgContainer [2019-11-20 00:16:43,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:16:43,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:16:43,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:16:43,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:16:43,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:16:42" (1/3) ... [2019-11-20 00:16:43,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379f5520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:16:43, skipping insertion in model container [2019-11-20 00:16:43,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:43" (2/3) ... [2019-11-20 00:16:43,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379f5520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:16:43, skipping insertion in model container [2019-11-20 00:16:43,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:16:43" (3/3) ... [2019-11-20 00:16:43,528 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2019-11-20 00:16:43,535 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:16:43,539 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:16:43,549 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:16:43,570 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:16:43,571 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:16:43,571 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:16:43,571 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:16:43,571 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:16:43,571 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:16:43,571 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:16:43,572 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:16:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-20 00:16:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-20 00:16:43,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:43,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-20 00:16:43,591 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:43,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash 963516, now seen corresponding path program 1 times [2019-11-20 00:16:43,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:43,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793352457] [2019-11-20 00:16:43,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:43,711 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-20 00:16:43,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793352457] [2019-11-20 00:16:43,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:43,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:16:43,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643792294] [2019-11-20 00:16:43,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:43,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:43,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:43,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:43,728 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-11-20 00:16:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:43,842 INFO L93 Difference]: Finished difference Result 131 states and 218 transitions. [2019-11-20 00:16:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:43,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-20 00:16:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:43,854 INFO L225 Difference]: With dead ends: 131 [2019-11-20 00:16:43,855 INFO L226 Difference]: Without dead ends: 79 [2019-11-20 00:16:43,857 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-20 00:16:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-20 00:16:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-20 00:16:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-20 00:16:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2019-11-20 00:16:43,895 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 4 [2019-11-20 00:16:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:43,895 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2019-11-20 00:16:43,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2019-11-20 00:16:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 00:16:43,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:43,896 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:43,896 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:43,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:43,897 INFO L82 PathProgramCache]: Analyzing trace with hash -737314741, now seen corresponding path program 1 times [2019-11-20 00:16:43,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:43,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552915720] [2019-11-20 00:16:43,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:43,925 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-20 00:16:43,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552915720] [2019-11-20 00:16:43,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:43,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:43,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971165021] [2019-11-20 00:16:43,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:43,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:43,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:43,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:43,928 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand 3 states. [2019-11-20 00:16:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:44,008 INFO L93 Difference]: Finished difference Result 157 states and 249 transitions. [2019-11-20 00:16:44,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:44,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-20 00:16:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:44,011 INFO L225 Difference]: With dead ends: 157 [2019-11-20 00:16:44,011 INFO L226 Difference]: Without dead ends: 117 [2019-11-20 00:16:44,012 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-20 00:16:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-20 00:16:44,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-11-20 00:16:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-20 00:16:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2019-11-20 00:16:44,031 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 9 [2019-11-20 00:16:44,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:44,032 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2019-11-20 00:16:44,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2019-11-20 00:16:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 00:16:44,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:44,034 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:44,034 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash -407668003, now seen corresponding path program 1 times [2019-11-20 00:16:44,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:44,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046791530] [2019-11-20 00:16:44,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:44,061 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-20 00:16:44,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046791530] [2019-11-20 00:16:44,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:44,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:44,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342747023] [2019-11-20 00:16:44,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:44,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:44,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:44,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:44,063 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand 3 states. [2019-11-20 00:16:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:44,140 INFO L93 Difference]: Finished difference Result 233 states and 365 transitions. [2019-11-20 00:16:44,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:44,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 00:16:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:44,145 INFO L225 Difference]: With dead ends: 233 [2019-11-20 00:16:44,146 INFO L226 Difference]: Without dead ends: 155 [2019-11-20 00:16:44,147 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-20 00:16:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-20 00:16:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-20 00:16:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 00:16:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2019-11-20 00:16:44,176 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 15 [2019-11-20 00:16:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:44,176 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2019-11-20 00:16:44,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2019-11-20 00:16:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 00:16:44,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:44,185 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-20 00:16:44,186 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:44,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1622407343, now seen corresponding path program 1 times [2019-11-20 00:16:44,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:44,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993208553] [2019-11-20 00:16:44,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:44,269 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-20 00:16:44,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993208553] [2019-11-20 00:16:44,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:44,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:44,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338512601] [2019-11-20 00:16:44,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:44,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:44,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:44,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:44,279 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand 3 states. [2019-11-20 00:16:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:44,423 INFO L93 Difference]: Finished difference Result 367 states and 579 transitions. [2019-11-20 00:16:44,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:44,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-20 00:16:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:44,426 INFO L225 Difference]: With dead ends: 367 [2019-11-20 00:16:44,426 INFO L226 Difference]: Without dead ends: 213 [2019-11-20 00:16:44,428 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-20 00:16:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-20 00:16:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2019-11-20 00:16:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-20 00:16:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 291 transitions. [2019-11-20 00:16:44,446 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 291 transitions. Word has length 30 [2019-11-20 00:16:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:44,446 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 291 transitions. [2019-11-20 00:16:44,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 291 transitions. [2019-11-20 00:16:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 00:16:44,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:44,449 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-20 00:16:44,450 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2042852816, now seen corresponding path program 1 times [2019-11-20 00:16:44,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:44,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980763231] [2019-11-20 00:16:44,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:44,526 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-20 00:16:44,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980763231] [2019-11-20 00:16:44,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:44,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:44,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725855995] [2019-11-20 00:16:44,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:44,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:44,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:44,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:44,528 INFO L87 Difference]: Start difference. First operand 207 states and 291 transitions. Second operand 3 states. [2019-11-20 00:16:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:44,582 INFO L93 Difference]: Finished difference Result 415 states and 588 transitions. [2019-11-20 00:16:44,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:44,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 00:16:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:44,585 INFO L225 Difference]: With dead ends: 415 [2019-11-20 00:16:44,585 INFO L226 Difference]: Without dead ends: 260 [2019-11-20 00:16:44,586 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-20 00:16:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-20 00:16:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-11-20 00:16:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 00:16:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 365 transitions. [2019-11-20 00:16:44,606 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 365 transitions. Word has length 44 [2019-11-20 00:16:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:44,606 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 365 transitions. [2019-11-20 00:16:44,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 365 transitions. [2019-11-20 00:16:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 00:16:44,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:44,609 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-20 00:16:44,609 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1056783528, now seen corresponding path program 1 times [2019-11-20 00:16:44,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:44,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683336798] [2019-11-20 00:16:44,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:44,642 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-20 00:16:44,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683336798] [2019-11-20 00:16:44,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:44,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:44,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937239833] [2019-11-20 00:16:44,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:44,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:44,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:44,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:44,644 INFO L87 Difference]: Start difference. First operand 258 states and 365 transitions. Second operand 3 states. [2019-11-20 00:16:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:44,723 INFO L93 Difference]: Finished difference Result 523 states and 752 transitions. [2019-11-20 00:16:44,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:44,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-20 00:16:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:44,725 INFO L225 Difference]: With dead ends: 523 [2019-11-20 00:16:44,725 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 00:16:44,726 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-20 00:16:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 00:16:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2019-11-20 00:16:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-20 00:16:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 244 transitions. [2019-11-20 00:16:44,738 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 244 transitions. Word has length 47 [2019-11-20 00:16:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:44,738 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 244 transitions. [2019-11-20 00:16:44,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 244 transitions. [2019-11-20 00:16:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 00:16:44,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:44,742 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-20 00:16:44,742 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash -439474765, now seen corresponding path program 1 times [2019-11-20 00:16:44,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:44,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639352000] [2019-11-20 00:16:44,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:44,813 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-20 00:16:44,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639352000] [2019-11-20 00:16:44,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:44,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:44,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526374982] [2019-11-20 00:16:44,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:44,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:44,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:44,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:44,819 INFO L87 Difference]: Start difference. First operand 185 states and 244 transitions. Second operand 3 states. [2019-11-20 00:16:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:44,838 INFO L93 Difference]: Finished difference Result 306 states and 375 transitions. [2019-11-20 00:16:44,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:44,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-20 00:16:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:44,839 INFO L225 Difference]: With dead ends: 306 [2019-11-20 00:16:44,839 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:16:44,840 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-20 00:16:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:16:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:16:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:16:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:16:44,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-11-20 00:16:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:44,843 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:16:44,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:16:44,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:16:44,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:16:45,104 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 189) no Hoare annotation was computed. [2019-11-20 00:16:45,104 INFO L444 ceAbstractionStarter]: For program point L151-1(lines 74 183) no Hoare annotation was computed. [2019-11-20 00:16:45,104 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 193) no Hoare annotation was computed. [2019-11-20 00:16:45,104 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 74 183) no Hoare annotation was computed. [2019-11-20 00:16:45,105 INFO L440 ceAbstractionStarter]: At program point L176(lines 22 211) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~blastFlag~0 3))) (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) .cse0) (<= ULTIMATE.start_main_~blastFlag~0 2) (and .cse0 (<= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0))))) [2019-11-20 00:16:45,105 INFO L444 ceAbstractionStarter]: For program point L44(lines 44 197) no Hoare annotation was computed. [2019-11-20 00:16:45,105 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 139) no Hoare annotation was computed. [2019-11-20 00:16:45,105 INFO L440 ceAbstractionStarter]: 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-20 00:16:45,105 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 201) no Hoare annotation was computed. [2019-11-20 00:16:45,105 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:16:45,106 INFO L440 ceAbstractionStarter]: At program point L61(lines 60 189) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,106 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:16:45,106 INFO L440 ceAbstractionStarter]: At program point L53(lines 52 193) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,106 INFO L440 ceAbstractionStarter]: At program point L45(lines 44 197) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,106 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 78 80) no Hoare annotation was computed. [2019-11-20 00:16:45,106 INFO L444 ceAbstractionStarter]: For program point L169-1(lines 74 183) no Hoare annotation was computed. [2019-11-20 00:16:45,107 INFO L440 ceAbstractionStarter]: At program point L37(lines 36 201) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,107 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 204) no Hoare annotation was computed. [2019-11-20 00:16:45,107 INFO L440 ceAbstractionStarter]: At program point L120(lines 113 122) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,107 INFO L440 ceAbstractionStarter]: At program point L112(lines 105 123) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,107 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 162 164) no Hoare annotation was computed. [2019-11-20 00:16:45,107 INFO L440 ceAbstractionStarter]: At program point L30(lines 29 204) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,108 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 123) no Hoare annotation was computed. [2019-11-20 00:16:45,108 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 183) no Hoare annotation was computed. [2019-11-20 00:16:45,108 INFO L444 ceAbstractionStarter]: For program point L64(lines 64 187) no Hoare annotation was computed. [2019-11-20 00:16:45,108 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 191) no Hoare annotation was computed. [2019-11-20 00:16:45,108 INFO L444 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-11-20 00:16:45,108 INFO L447 ceAbstractionStarter]: At program point L213(lines 8 217) the Hoare annotation is: true [2019-11-20 00:16:45,108 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 118) no Hoare annotation was computed. [2019-11-20 00:16:45,109 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 195) no Hoare annotation was computed. [2019-11-20 00:16:45,109 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 174) no Hoare annotation was computed. [2019-11-20 00:16:45,109 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 110) no Hoare annotation was computed. [2019-11-20 00:16:45,109 INFO L440 ceAbstractionStarter]: 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-20 00:16:45,109 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 199) no Hoare annotation was computed. [2019-11-20 00:16:45,109 INFO L440 ceAbstractionStarter]: 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-20 00:16:45,110 INFO L444 ceAbstractionStarter]: For program point L32(lines 32 203) no Hoare annotation was computed. [2019-11-20 00:16:45,110 INFO L440 ceAbstractionStarter]: At program point L57(lines 56 191) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,110 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 215) no Hoare annotation was computed. [2019-11-20 00:16:45,110 INFO L440 ceAbstractionStarter]: At program point L49(lines 48 195) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,115 INFO L440 ceAbstractionStarter]: At program point L173(lines 8 217) the Hoare annotation is: false [2019-11-20 00:16:45,116 INFO L440 ceAbstractionStarter]: At program point L41(lines 40 199) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,116 INFO L440 ceAbstractionStarter]: At program point L33(lines 32 203) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-11-20 00:16:45,117 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:16:45,117 INFO L447 ceAbstractionStarter]: At program point L216(lines 8 217) the Hoare annotation is: true [2019-11-20 00:16:45,118 INFO L444 ceAbstractionStarter]: For program point L68(lines 68 185) no Hoare annotation was computed. [2019-11-20 00:16:45,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:16:45 BoogieIcfgContainer [2019-11-20 00:16:45,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:16:45,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:16:45,139 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:16:45,139 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:16:45,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:16:43" (3/4) ... [2019-11-20 00:16:45,143 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:16:45,156 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 00:16:45,156 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 00:16:45,260 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_da4c87c9-d3cc-4eaf-bdc3-9cdb0f6da3dc/bin/uautomizer/witness.graphml [2019-11-20 00:16:45,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:16:45,263 INFO L168 Benchmark]: Toolchain (without parser) took 2525.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 950.1 MB in the beginning and 992.2 MB in the end (delta: -42.1 MB). Peak memory consumption was 147.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:45,263 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:16:45,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -233.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:45,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:16:45,264 INFO L168 Benchmark]: Boogie Preprocessor took 50.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:45,264 INFO L168 Benchmark]: RCFGBuilder took 380.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:45,265 INFO L168 Benchmark]: TraceAbstraction took 1616.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 997.6 MB in the end (delta: 156.6 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:45,265 INFO L168 Benchmark]: Witness Printer took 121.68 ms. Allocated memory is still 1.2 GB. Free memory was 997.6 MB in the beginning and 992.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:45,268 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.57 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -233.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 380.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1616.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 997.6 MB in the end (delta: 156.6 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. * Witness Printer took 121.68 ms. Allocated memory is still 1.2 GB. Free memory was 997.6 MB in the beginning and 992.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 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: ((8672 <= s__state && blastFlag <= 3) || blastFlag <= 2) || ((blastFlag <= 3 && 8640 <= s__state) && !(s__hit == 0)) - 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.5s, OverallIterations: 7, TraceHistogramMax: 6, AutomataDifference: 0.6s, 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...