./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh/s3_clnt.blast.04_false-unreach-call.i.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 c271f3a8f5eeb9abed31f7632ddca02a2bd7f129 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c271f3a8f5eeb9abed31f7632ddca02a2bd7f129 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:07:44,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:07:44,030 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:07:44,042 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:07:44,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:07:44,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:07:44,046 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:07:44,048 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:07:44,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:07:44,051 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:07:44,052 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:07:44,052 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:07:44,054 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:07:44,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:07:44,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:07:44,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:07:44,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:07:44,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:07:44,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:07:44,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:07:44,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:07:44,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:07:44,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:07:44,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:07:44,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:07:44,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:07:44,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:07:44,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:07:44,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:07:44,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:07:44,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:07:44,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:07:44,079 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:07:44,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:07:44,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:07:44,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:07:44,082 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:07:44,103 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:07:44,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:07:44,105 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:07:44,105 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:07:44,105 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:07:44,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:07:44,106 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:07:44,106 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:07:44,106 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:07:44,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:07:44,108 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:07:44,108 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:07:44,108 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:07:44,108 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:07:44,108 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:07:44,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:07:44,109 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:07:44,109 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:07:44,109 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:07:44,109 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:07:44,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:07:44,110 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:07:44,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:07:44,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:07:44,111 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:07:44,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:07:44,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:07:44,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c271f3a8f5eeb9abed31f7632ddca02a2bd7f129 [2019-01-14 15:07:44,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:07:44,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:07:44,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:07:44,163 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:07:44,164 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:07:44,165 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c [2019-01-14 15:07:44,221 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb4f5438/b326537c8bbb4289a86a11933d7a314f/FLAG523d11b82 [2019-01-14 15:07:44,815 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:07:44,816 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c [2019-01-14 15:07:44,850 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb4f5438/b326537c8bbb4289a86a11933d7a314f/FLAG523d11b82 [2019-01-14 15:07:45,063 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb4f5438/b326537c8bbb4289a86a11933d7a314f [2019-01-14 15:07:45,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:07:45,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:07:45,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:07:45,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:07:45,075 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:07:45,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:07:45" (1/1) ... [2019-01-14 15:07:45,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e13714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:45, skipping insertion in model container [2019-01-14 15:07:45,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:07:45" (1/1) ... [2019-01-14 15:07:45,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:07:45,169 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:07:45,677 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:07:45,697 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:07:45,990 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:07:46,024 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:07:46,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46 WrapperNode [2019-01-14 15:07:46,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:07:46,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:07:46,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:07:46,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:07:46,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (1/1) ... [2019-01-14 15:07:46,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (1/1) ... [2019-01-14 15:07:46,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:07:46,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:07:46,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:07:46,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:07:46,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (1/1) ... [2019-01-14 15:07:46,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (1/1) ... [2019-01-14 15:07:46,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (1/1) ... [2019-01-14 15:07:46,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (1/1) ... [2019-01-14 15:07:46,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (1/1) ... [2019-01-14 15:07:46,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (1/1) ... [2019-01-14 15:07:46,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (1/1) ... [2019-01-14 15:07:46,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:07:46,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:07:46,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:07:46,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:07:46,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (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-01-14 15:07:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:07:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:07:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:07:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:07:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:07:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:07:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 15:07:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:07:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:07:46,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:07:46,759 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:07:48,526 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 15:07:48,527 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 15:07:48,528 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:07:48,529 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:07:48,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:48 BoogieIcfgContainer [2019-01-14 15:07:48,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:07:48,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:07:48,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:07:48,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:07:48,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:07:45" (1/3) ... [2019-01-14 15:07:48,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71eae15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:07:48, skipping insertion in model container [2019-01-14 15:07:48,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:46" (2/3) ... [2019-01-14 15:07:48,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71eae15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:07:48, skipping insertion in model container [2019-01-14 15:07:48,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:48" (3/3) ... [2019-01-14 15:07:48,539 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04_false-unreach-call.i.cil.c [2019-01-14 15:07:48,549 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:07:48,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:07:48,575 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:07:48,609 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:07:48,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:07:48,610 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:07:48,610 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:07:48,610 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:07:48,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:07:48,611 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:07:48,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:07:48,611 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:07:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-01-14 15:07:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 15:07:48,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:48,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:48,643 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:48,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:48,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-01-14 15:07:48,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:48,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:48,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:48,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:48,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:49,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:49,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:07:49,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:07:49,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:07:49,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:07:49,043 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2019-01-14 15:07:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:49,322 INFO L93 Difference]: Finished difference Result 369 states and 623 transitions. [2019-01-14 15:07:49,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:07:49,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 15:07:49,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:49,339 INFO L225 Difference]: With dead ends: 369 [2019-01-14 15:07:49,339 INFO L226 Difference]: Without dead ends: 213 [2019-01-14 15:07:49,344 INFO L631 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-01-14 15:07:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-14 15:07:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-14 15:07:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-14 15:07:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2019-01-14 15:07:49,413 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2019-01-14 15:07:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:49,413 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2019-01-14 15:07:49,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:07:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2019-01-14 15:07:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 15:07:49,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:49,418 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:49,418 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:49,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:49,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1192110763, now seen corresponding path program 1 times [2019-01-14 15:07:49,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:49,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:49,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:49,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:49,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:49,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:49,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:49,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:49,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:49,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:49,678 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand 4 states. [2019-01-14 15:07:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:50,653 INFO L93 Difference]: Finished difference Result 353 states and 528 transitions. [2019-01-14 15:07:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:50,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-14 15:07:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:50,656 INFO L225 Difference]: With dead ends: 353 [2019-01-14 15:07:50,657 INFO L226 Difference]: Without dead ends: 248 [2019-01-14 15:07:50,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-14 15:07:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 231. [2019-01-14 15:07:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2019-01-14 15:07:50,688 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 39 [2019-01-14 15:07:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:50,688 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2019-01-14 15:07:50,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2019-01-14 15:07:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 15:07:50,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:50,691 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:50,692 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash -48955901, now seen corresponding path program 1 times [2019-01-14 15:07:50,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:50,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:50,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:50,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:50,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:50,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:50,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:50,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:50,860 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand 4 states. [2019-01-14 15:07:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:51,470 INFO L93 Difference]: Finished difference Result 370 states and 556 transitions. [2019-01-14 15:07:51,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:51,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-14 15:07:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:51,475 INFO L225 Difference]: With dead ends: 370 [2019-01-14 15:07:51,475 INFO L226 Difference]: Without dead ends: 247 [2019-01-14 15:07:51,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-14 15:07:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2019-01-14 15:07:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 346 transitions. [2019-01-14 15:07:51,491 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 346 transitions. Word has length 53 [2019-01-14 15:07:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:51,492 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 346 transitions. [2019-01-14 15:07:51,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 346 transitions. [2019-01-14 15:07:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 15:07:51,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:51,495 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:51,495 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:51,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:51,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1157936347, now seen corresponding path program 1 times [2019-01-14 15:07:51,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:51,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:51,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:51,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:51,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:51,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:51,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:51,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:51,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:51,827 INFO L87 Difference]: Start difference. First operand 231 states and 346 transitions. Second operand 4 states. [2019-01-14 15:07:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:52,603 INFO L93 Difference]: Finished difference Result 370 states and 554 transitions. [2019-01-14 15:07:52,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:52,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-14 15:07:52,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:52,606 INFO L225 Difference]: With dead ends: 370 [2019-01-14 15:07:52,606 INFO L226 Difference]: Without dead ends: 247 [2019-01-14 15:07:52,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:52,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-14 15:07:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2019-01-14 15:07:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 345 transitions. [2019-01-14 15:07:52,634 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 345 transitions. Word has length 53 [2019-01-14 15:07:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:52,635 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 345 transitions. [2019-01-14 15:07:52,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 345 transitions. [2019-01-14 15:07:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 15:07:52,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:52,639 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:52,639 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1481895382, now seen corresponding path program 1 times [2019-01-14 15:07:52,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:52,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:52,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:52,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:52,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:52,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:52,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:52,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:52,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:52,798 INFO L87 Difference]: Start difference. First operand 231 states and 345 transitions. Second operand 4 states. [2019-01-14 15:07:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:53,349 INFO L93 Difference]: Finished difference Result 370 states and 552 transitions. [2019-01-14 15:07:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:53,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-14 15:07:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:53,352 INFO L225 Difference]: With dead ends: 370 [2019-01-14 15:07:53,352 INFO L226 Difference]: Without dead ends: 247 [2019-01-14 15:07:53,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-14 15:07:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2019-01-14 15:07:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 344 transitions. [2019-01-14 15:07:53,362 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 344 transitions. Word has length 54 [2019-01-14 15:07:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:53,363 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 344 transitions. [2019-01-14 15:07:53,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 344 transitions. [2019-01-14 15:07:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 15:07:53,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:53,365 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:53,365 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:53,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1416857056, now seen corresponding path program 1 times [2019-01-14 15:07:53,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:53,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:53,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:53,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:53,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:53,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:53,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:53,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:53,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:53,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:53,538 INFO L87 Difference]: Start difference. First operand 231 states and 344 transitions. Second operand 4 states. [2019-01-14 15:07:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:54,095 INFO L93 Difference]: Finished difference Result 370 states and 550 transitions. [2019-01-14 15:07:54,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:54,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-14 15:07:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:54,097 INFO L225 Difference]: With dead ends: 370 [2019-01-14 15:07:54,097 INFO L226 Difference]: Without dead ends: 247 [2019-01-14 15:07:54,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:54,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-14 15:07:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2019-01-14 15:07:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 343 transitions. [2019-01-14 15:07:54,106 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 343 transitions. Word has length 55 [2019-01-14 15:07:54,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:54,106 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 343 transitions. [2019-01-14 15:07:54,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 343 transitions. [2019-01-14 15:07:54,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 15:07:54,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:54,108 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:54,108 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:54,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:54,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1140450053, now seen corresponding path program 1 times [2019-01-14 15:07:54,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:54,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:54,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:54,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:54,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:07:54,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:54,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:54,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:54,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:54,214 INFO L87 Difference]: Start difference. First operand 231 states and 343 transitions. Second operand 4 states. [2019-01-14 15:07:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:54,625 INFO L93 Difference]: Finished difference Result 361 states and 537 transitions. [2019-01-14 15:07:54,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:54,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-14 15:07:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:54,628 INFO L225 Difference]: With dead ends: 361 [2019-01-14 15:07:54,628 INFO L226 Difference]: Without dead ends: 238 [2019-01-14 15:07:54,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-01-14 15:07:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 231. [2019-01-14 15:07:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 342 transitions. [2019-01-14 15:07:54,636 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 342 transitions. Word has length 56 [2019-01-14 15:07:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:54,636 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 342 transitions. [2019-01-14 15:07:54,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 342 transitions. [2019-01-14 15:07:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 15:07:54,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:54,638 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:54,638 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:54,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:54,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1701754597, now seen corresponding path program 1 times [2019-01-14 15:07:54,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:54,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:54,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:54,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:54,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 15:07:54,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:54,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:07:54,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:07:54,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:07:54,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:07:54,753 INFO L87 Difference]: Start difference. First operand 231 states and 342 transitions. Second operand 3 states. [2019-01-14 15:07:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:54,825 INFO L93 Difference]: Finished difference Result 475 states and 707 transitions. [2019-01-14 15:07:54,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:07:54,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-14 15:07:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:54,830 INFO L225 Difference]: With dead ends: 475 [2019-01-14 15:07:54,830 INFO L226 Difference]: Without dead ends: 352 [2019-01-14 15:07:54,831 INFO L631 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-01-14 15:07:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-01-14 15:07:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-01-14 15:07:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-01-14 15:07:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 521 transitions. [2019-01-14 15:07:54,842 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 521 transitions. Word has length 57 [2019-01-14 15:07:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:54,844 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 521 transitions. [2019-01-14 15:07:54,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:07:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 521 transitions. [2019-01-14 15:07:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:07:54,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:54,845 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:54,846 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:54,846 INFO L82 PathProgramCache]: Analyzing trace with hash -998738617, now seen corresponding path program 1 times [2019-01-14 15:07:54,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:54,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:54,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:54,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:54,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 15:07:55,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:55,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:55,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:55,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:55,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:55,071 INFO L87 Difference]: Start difference. First operand 352 states and 521 transitions. Second operand 4 states. [2019-01-14 15:07:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:56,254 INFO L93 Difference]: Finished difference Result 974 states and 1448 transitions. [2019-01-14 15:07:56,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:56,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 15:07:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:56,259 INFO L225 Difference]: With dead ends: 974 [2019-01-14 15:07:56,260 INFO L226 Difference]: Without dead ends: 629 [2019-01-14 15:07:56,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-01-14 15:07:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 415. [2019-01-14 15:07:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-01-14 15:07:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 626 transitions. [2019-01-14 15:07:56,285 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 626 transitions. Word has length 77 [2019-01-14 15:07:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:56,285 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 626 transitions. [2019-01-14 15:07:56,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 626 transitions. [2019-01-14 15:07:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:07:56,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:56,287 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:56,287 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:56,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1246840837, now seen corresponding path program 1 times [2019-01-14 15:07:56,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:56,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:56,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:56,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:56,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:07:56,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:56,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:56,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:56,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:56,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:56,670 INFO L87 Difference]: Start difference. First operand 415 states and 626 transitions. Second operand 4 states. [2019-01-14 15:07:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:57,526 INFO L93 Difference]: Finished difference Result 966 states and 1455 transitions. [2019-01-14 15:07:57,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:57,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 15:07:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:57,533 INFO L225 Difference]: With dead ends: 966 [2019-01-14 15:07:57,539 INFO L226 Difference]: Without dead ends: 558 [2019-01-14 15:07:57,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:07:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-14 15:07:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 481. [2019-01-14 15:07:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:07:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 740 transitions. [2019-01-14 15:07:57,569 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 740 transitions. Word has length 77 [2019-01-14 15:07:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:57,569 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 740 transitions. [2019-01-14 15:07:57,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 740 transitions. [2019-01-14 15:07:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 15:07:57,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:57,577 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:07:57,577 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:57,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash 21280221, now seen corresponding path program 1 times [2019-01-14 15:07:57,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:57,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:57,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:57,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:07:57,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:57,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:57,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:57,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:57,951 INFO L87 Difference]: Start difference. First operand 481 states and 740 transitions. Second operand 4 states. [2019-01-14 15:08:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:00,098 INFO L93 Difference]: Finished difference Result 1029 states and 1563 transitions. [2019-01-14 15:08:00,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:00,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-14 15:08:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:00,105 INFO L225 Difference]: With dead ends: 1029 [2019-01-14 15:08:00,105 INFO L226 Difference]: Without dead ends: 555 [2019-01-14 15:08:00,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-01-14 15:08:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 481. [2019-01-14 15:08:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 737 transitions. [2019-01-14 15:08:00,125 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 737 transitions. Word has length 91 [2019-01-14 15:08:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:00,125 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-01-14 15:08:00,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 737 transitions. [2019-01-14 15:08:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 15:08:00,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:00,129 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:00,129 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:00,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1087700225, now seen corresponding path program 1 times [2019-01-14 15:08:00,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:00,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:00,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:00,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:00,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:08:00,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:00,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:00,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:00,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:00,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:00,380 INFO L87 Difference]: Start difference. First operand 481 states and 737 transitions. Second operand 4 states. [2019-01-14 15:08:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:01,359 INFO L93 Difference]: Finished difference Result 1029 states and 1557 transitions. [2019-01-14 15:08:01,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:01,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-14 15:08:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:01,362 INFO L225 Difference]: With dead ends: 1029 [2019-01-14 15:08:01,363 INFO L226 Difference]: Without dead ends: 555 [2019-01-14 15:08:01,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-01-14 15:08:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 481. [2019-01-14 15:08:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 734 transitions. [2019-01-14 15:08:01,385 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 734 transitions. Word has length 91 [2019-01-14 15:08:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:01,385 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 734 transitions. [2019-01-14 15:08:01,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 734 transitions. [2019-01-14 15:08:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 15:08:01,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:01,389 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:01,389 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:01,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash 695424400, now seen corresponding path program 1 times [2019-01-14 15:08:01,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:01,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:01,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:01,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:01,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:08:01,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:01,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:01,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:01,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:01,616 INFO L87 Difference]: Start difference. First operand 481 states and 734 transitions. Second operand 4 states. [2019-01-14 15:08:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:02,020 INFO L93 Difference]: Finished difference Result 1029 states and 1551 transitions. [2019-01-14 15:08:02,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:02,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-14 15:08:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:02,025 INFO L225 Difference]: With dead ends: 1029 [2019-01-14 15:08:02,025 INFO L226 Difference]: Without dead ends: 555 [2019-01-14 15:08:02,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:02,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-01-14 15:08:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 481. [2019-01-14 15:08:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 731 transitions. [2019-01-14 15:08:02,045 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 731 transitions. Word has length 92 [2019-01-14 15:08:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:02,045 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 731 transitions. [2019-01-14 15:08:02,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 731 transitions. [2019-01-14 15:08:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 15:08:02,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:02,049 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:02,049 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:02,050 INFO L82 PathProgramCache]: Analyzing trace with hash 194293562, now seen corresponding path program 1 times [2019-01-14 15:08:02,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:02,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:02,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:02,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:08:02,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:02,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:02,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:02,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:02,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:02,205 INFO L87 Difference]: Start difference. First operand 481 states and 731 transitions. Second operand 4 states. [2019-01-14 15:08:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:02,715 INFO L93 Difference]: Finished difference Result 1029 states and 1545 transitions. [2019-01-14 15:08:02,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:02,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-14 15:08:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:02,719 INFO L225 Difference]: With dead ends: 1029 [2019-01-14 15:08:02,719 INFO L226 Difference]: Without dead ends: 555 [2019-01-14 15:08:02,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:02,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-01-14 15:08:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 481. [2019-01-14 15:08:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 728 transitions. [2019-01-14 15:08:02,737 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 728 transitions. Word has length 93 [2019-01-14 15:08:02,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:02,738 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 728 transitions. [2019-01-14 15:08:02,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 728 transitions. [2019-01-14 15:08:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-14 15:08:02,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:02,739 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:02,740 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:02,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:02,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1895687403, now seen corresponding path program 1 times [2019-01-14 15:08:02,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:02,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:02,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:08:03,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:03,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:03,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:03,022 INFO L87 Difference]: Start difference. First operand 481 states and 728 transitions. Second operand 4 states. [2019-01-14 15:08:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:03,410 INFO L93 Difference]: Finished difference Result 1002 states and 1506 transitions. [2019-01-14 15:08:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:03,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-14 15:08:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:03,415 INFO L225 Difference]: With dead ends: 1002 [2019-01-14 15:08:03,415 INFO L226 Difference]: Without dead ends: 528 [2019-01-14 15:08:03,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-01-14 15:08:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 481. [2019-01-14 15:08:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 725 transitions. [2019-01-14 15:08:03,435 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 725 transitions. Word has length 94 [2019-01-14 15:08:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:03,435 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 725 transitions. [2019-01-14 15:08:03,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 725 transitions. [2019-01-14 15:08:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-14 15:08:03,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:03,439 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:03,440 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:03,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:03,440 INFO L82 PathProgramCache]: Analyzing trace with hash -593651715, now seen corresponding path program 1 times [2019-01-14 15:08:03,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:03,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:03,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:03,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:03,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:08:03,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:03,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:03,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:03,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:03,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:03,723 INFO L87 Difference]: Start difference. First operand 481 states and 725 transitions. Second operand 4 states. [2019-01-14 15:08:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:04,177 INFO L93 Difference]: Finished difference Result 1002 states and 1500 transitions. [2019-01-14 15:08:04,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:04,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-14 15:08:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:04,180 INFO L225 Difference]: With dead ends: 1002 [2019-01-14 15:08:04,180 INFO L226 Difference]: Without dead ends: 528 [2019-01-14 15:08:04,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-01-14 15:08:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 481. [2019-01-14 15:08:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 722 transitions. [2019-01-14 15:08:04,198 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 722 transitions. Word has length 95 [2019-01-14 15:08:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:04,198 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 722 transitions. [2019-01-14 15:08:04,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 722 transitions. [2019-01-14 15:08:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 15:08:04,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:04,200 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:04,200 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:04,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2065695790, now seen corresponding path program 1 times [2019-01-14 15:08:04,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:04,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:04,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:04,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:04,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:08:04,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:04,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:04,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:04,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:04,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:04,498 INFO L87 Difference]: Start difference. First operand 481 states and 722 transitions. Second operand 4 states. [2019-01-14 15:08:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:04,887 INFO L93 Difference]: Finished difference Result 990 states and 1477 transitions. [2019-01-14 15:08:04,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:04,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-14 15:08:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:04,890 INFO L225 Difference]: With dead ends: 990 [2019-01-14 15:08:04,890 INFO L226 Difference]: Without dead ends: 516 [2019-01-14 15:08:04,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-01-14 15:08:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 481. [2019-01-14 15:08:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 719 transitions. [2019-01-14 15:08:04,907 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 719 transitions. Word has length 96 [2019-01-14 15:08:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:04,908 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 719 transitions. [2019-01-14 15:08:04,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:04,908 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 719 transitions. [2019-01-14 15:08:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:08:04,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:04,910 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:04,910 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:04,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:04,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1220596582, now seen corresponding path program 1 times [2019-01-14 15:08:04,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:04,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:04,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:04,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:04,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 15:08:05,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:05,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:08:05,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:08:05,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:08:05,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:08:05,079 INFO L87 Difference]: Start difference. First operand 481 states and 719 transitions. Second operand 6 states. [2019-01-14 15:08:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:05,863 INFO L93 Difference]: Finished difference Result 896 states and 1337 transitions. [2019-01-14 15:08:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:08:05,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-01-14 15:08:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:05,866 INFO L225 Difference]: With dead ends: 896 [2019-01-14 15:08:05,866 INFO L226 Difference]: Without dead ends: 564 [2019-01-14 15:08:05,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:08:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-01-14 15:08:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 489. [2019-01-14 15:08:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-01-14 15:08:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 732 transitions. [2019-01-14 15:08:05,885 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 732 transitions. Word has length 98 [2019-01-14 15:08:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:05,885 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 732 transitions. [2019-01-14 15:08:05,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:08:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 732 transitions. [2019-01-14 15:08:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 15:08:05,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:05,887 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:05,887 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash 390392751, now seen corresponding path program 1 times [2019-01-14 15:08:05,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:05,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:05,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:06,144 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 15:08:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 15:08:06,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:06,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:08:06,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:08:06,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:08:06,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:08:06,293 INFO L87 Difference]: Start difference. First operand 489 states and 732 transitions. Second operand 6 states. [2019-01-14 15:08:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:07,089 INFO L93 Difference]: Finished difference Result 893 states and 1333 transitions. [2019-01-14 15:08:07,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:08:07,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-01-14 15:08:07,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:07,092 INFO L225 Difference]: With dead ends: 893 [2019-01-14 15:08:07,092 INFO L226 Difference]: Without dead ends: 561 [2019-01-14 15:08:07,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:08:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-01-14 15:08:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 490. [2019-01-14 15:08:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-01-14 15:08:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 733 transitions. [2019-01-14 15:08:07,110 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 733 transitions. Word has length 99 [2019-01-14 15:08:07,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:07,110 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 733 transitions. [2019-01-14 15:08:07,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:08:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 733 transitions. [2019-01-14 15:08:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 15:08:07,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:07,112 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:07,112 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:07,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2019-01-14 15:08:07,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:07,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:07,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:08:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:08:07,789 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:08:07,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:08:07 BoogieIcfgContainer [2019-01-14 15:08:07,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:08:07,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:08:07,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:08:07,905 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:08:07,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:48" (3/4) ... [2019-01-14 15:08:07,911 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 15:08:07,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:08:07,912 INFO L168 Benchmark]: Toolchain (without parser) took 22843.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 146.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,913 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:08:07,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 955.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.26 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,915 INFO L168 Benchmark]: Boogie Preprocessor took 146.68 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,919 INFO L168 Benchmark]: RCFGBuilder took 2218.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.3 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,920 INFO L168 Benchmark]: TraceAbstraction took 19372.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -107.1 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,923 INFO L168 Benchmark]: Witness Printer took 6.18 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-14 15:08:07,933 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 955.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.26 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 146.68 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2218.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.3 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19372.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -107.1 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.18 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1643]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1334. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={-4:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [init=1, SSLv3_client_data={-4:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={-4:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-4:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [init=1, SSLv3_client_data={-4:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-4:0}] [L1249] EXPR s->version VAL [init=1, SSLv3_client_data={-4:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [init=1, SSLv3_client_data={-4:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={-4:0}] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [init=1, SSLv3_client_data={-4:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-4:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={-4:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-4:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [init=1, SSLv3_client_data={-4:0}] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [init=1, SSLv3_client_data={-4:0}] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-4:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={-4:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-4:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [init=1, SSLv3_client_data={-4:0}] [L1320] COND FALSE !(ret <= 0) [L1325] s->hit VAL [init=1, SSLv3_client_data={-4:0}] [L1325] COND FALSE !(s->hit) [L1328] s->state = 4400 VAL [init=1, SSLv3_client_data={-4:0}] [L1330] s->init_num = 0 VAL [init=1, SSLv3_client_data={-4:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-4:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={-4:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-4:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1160] COND TRUE s->state == 4400 [L1334] EXPR s->s3 [L1334] EXPR (s->s3)->tmp.new_cipher [L1334] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={-4:0}] [L1334] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1337] ret = __VERIFIER_nondet_int() [L1338] COND TRUE blastFlag == 2 [L1339] blastFlag = 3 VAL [init=1, SSLv3_client_data={-4:0}] [L1347] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-4:0}] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [init=1, SSLv3_client_data={-4:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-4:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={-4:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-4:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [init=1, SSLv3_client_data={-4:0}] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [init=1, SSLv3_client_data={-4:0}] [L1371] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-4:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-4:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={-4:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-4:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={-4:0}] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-4:0}] [L1643] __VERIFIER_error() VAL [init=1, SSLv3_client_data={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. UNSAFE Result, 19.3s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 13.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3620 SDtfs, 1513 SDslu, 5137 SDs, 0 SdLazy, 2812 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 18 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 950 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1506 NumberOfCodeBlocks, 1506 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1375 ConstructedInterpolants, 0 QuantifiedInterpolants, 257889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 1218/1218 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:08:10,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:08:10,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:08:10,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:08:10,216 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:08:10,217 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:08:10,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:08:10,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:08:10,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:08:10,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:08:10,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:08:10,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:08:10,225 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:08:10,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:08:10,227 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:08:10,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:08:10,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:08:10,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:08:10,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:08:10,237 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:08:10,238 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:08:10,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:08:10,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:08:10,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:08:10,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:08:10,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:08:10,255 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:08:10,256 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:08:10,257 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:08:10,259 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:08:10,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:08:10,260 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:08:10,261 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:08:10,261 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:08:10,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:08:10,262 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:08:10,264 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-14 15:08:10,292 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:08:10,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:08:10,295 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:08:10,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:08:10,295 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:08:10,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:08:10,295 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:08:10,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:08:10,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:08:10,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:08:10,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:08:10,296 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:08:10,296 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 15:08:10,296 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 15:08:10,297 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:08:10,297 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:08:10,297 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:08:10,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:08:10,298 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:08:10,298 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:08:10,298 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:08:10,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:08:10,298 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:08:10,299 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:08:10,300 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:08:10,300 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 15:08:10,300 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:08:10,300 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 15:08:10,300 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-14 15:08:10,301 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c271f3a8f5eeb9abed31f7632ddca02a2bd7f129 [2019-01-14 15:08:10,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:08:10,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:08:10,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:08:10,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:08:10,378 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:08:10,379 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c [2019-01-14 15:08:10,434 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad558270/b774935998ba482989610d4a866e551c/FLAGdd7af3dab [2019-01-14 15:08:10,947 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:08:10,947 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c [2019-01-14 15:08:10,977 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad558270/b774935998ba482989610d4a866e551c/FLAGdd7af3dab [2019-01-14 15:08:11,203 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad558270/b774935998ba482989610d4a866e551c [2019-01-14 15:08:11,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:08:11,209 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:08:11,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:08:11,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:08:11,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:08:11,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:08:11" (1/1) ... [2019-01-14 15:08:11,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c23ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:11, skipping insertion in model container [2019-01-14 15:08:11,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:08:11" (1/1) ... [2019-01-14 15:08:11,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:08:11,297 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:08:11,846 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:08:11,866 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:08:12,136 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:08:12,169 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:08:12,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12 WrapperNode [2019-01-14 15:08:12,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:08:12,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:08:12,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:08:12,171 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:08:12,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (1/1) ... [2019-01-14 15:08:12,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (1/1) ... [2019-01-14 15:08:12,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:08:12,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:08:12,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:08:12,260 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:08:12,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (1/1) ... [2019-01-14 15:08:12,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (1/1) ... [2019-01-14 15:08:12,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (1/1) ... [2019-01-14 15:08:12,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (1/1) ... [2019-01-14 15:08:12,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (1/1) ... [2019-01-14 15:08:12,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (1/1) ... [2019-01-14 15:08:12,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (1/1) ... [2019-01-14 15:08:12,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:08:12,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:08:12,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:08:12,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:08:12,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (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-01-14 15:08:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:08:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-01-14 15:08:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:08:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:08:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-14 15:08:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:08:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:08:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:08:12,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:08:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-14 15:08:12,853 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:08:17,525 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 15:08:17,525 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 15:08:17,526 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:08:17,527 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:08:17,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:17 BoogieIcfgContainer [2019-01-14 15:08:17,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:08:17,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:08:17,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:08:17,533 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:08:17,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:08:11" (1/3) ... [2019-01-14 15:08:17,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136dbba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:08:17, skipping insertion in model container [2019-01-14 15:08:17,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:12" (2/3) ... [2019-01-14 15:08:17,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136dbba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:08:17, skipping insertion in model container [2019-01-14 15:08:17,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:17" (3/3) ... [2019-01-14 15:08:17,536 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04_false-unreach-call.i.cil.c [2019-01-14 15:08:17,545 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:08:17,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:08:17,568 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:08:17,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:08:17,604 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:08:17,604 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:08:17,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:08:17,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:08:17,605 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:08:17,606 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:08:17,606 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:08:17,606 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:08:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-01-14 15:08:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 15:08:17,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:17,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:17,638 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:17,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-01-14 15:08:17,648 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:17,649 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:08:17,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:17,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:17,911 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:17,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:17,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:17,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:17,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:17,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:17,939 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2019-01-14 15:08:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:18,117 INFO L93 Difference]: Finished difference Result 369 states and 623 transitions. [2019-01-14 15:08:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:18,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 15:08:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:18,136 INFO L225 Difference]: With dead ends: 369 [2019-01-14 15:08:18,136 INFO L226 Difference]: Without dead ends: 213 [2019-01-14 15:08:18,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-01-14 15:08:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-14 15:08:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-14 15:08:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-14 15:08:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2019-01-14 15:08:18,196 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2019-01-14 15:08:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:18,196 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2019-01-14 15:08:18,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2019-01-14 15:08:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 15:08:18,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:18,200 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:18,200 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1192110763, now seen corresponding path program 1 times [2019-01-14 15:08:18,202 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:18,202 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:08:18,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:18,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:18,437 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2019-01-14 15:08:18,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:18,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:18,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:18,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:18,450 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand 3 states. [2019-01-14 15:08:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:20,768 INFO L93 Difference]: Finished difference Result 418 states and 628 transitions. [2019-01-14 15:08:20,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:20,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-14 15:08:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:20,775 INFO L225 Difference]: With dead ends: 418 [2019-01-14 15:08:20,775 INFO L226 Difference]: Without dead ends: 313 [2019-01-14 15:08:20,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-01-14 15:08:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-14 15:08:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2019-01-14 15:08:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-01-14 15:08:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 464 transitions. [2019-01-14 15:08:20,814 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 464 transitions. Word has length 39 [2019-01-14 15:08:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:20,814 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 464 transitions. [2019-01-14 15:08:20,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 464 transitions. [2019-01-14 15:08:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 15:08:20,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:20,819 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:20,819 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1701754597, now seen corresponding path program 1 times [2019-01-14 15:08:20,820 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:20,820 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:08:20,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:20,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 15:08:21,064 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:21,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:21,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:21,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:21,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:21,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:21,069 INFO L87 Difference]: Start difference. First operand 313 states and 464 transitions. Second operand 3 states. [2019-01-14 15:08:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:23,329 INFO L93 Difference]: Finished difference Result 619 states and 923 transitions. [2019-01-14 15:08:23,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:23,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-14 15:08:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:23,333 INFO L225 Difference]: With dead ends: 619 [2019-01-14 15:08:23,334 INFO L226 Difference]: Without dead ends: 414 [2019-01-14 15:08:23,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-01-14 15:08:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-14 15:08:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2019-01-14 15:08:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-01-14 15:08:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2019-01-14 15:08:23,365 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2019-01-14 15:08:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:23,368 INFO L480 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2019-01-14 15:08:23,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2019-01-14 15:08:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:08:23,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:23,377 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:23,379 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:23,379 INFO L82 PathProgramCache]: Analyzing trace with hash -998738617, now seen corresponding path program 1 times [2019-01-14 15:08:23,380 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:23,380 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:08:23,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:23,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:08:23,655 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:23,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:23,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:23,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:23,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:23,660 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand 3 states. [2019-01-14 15:08:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:25,892 INFO L93 Difference]: Finished difference Result 821 states and 1222 transitions. [2019-01-14 15:08:25,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:25,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-01-14 15:08:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:25,896 INFO L225 Difference]: With dead ends: 821 [2019-01-14 15:08:25,896 INFO L226 Difference]: Without dead ends: 515 [2019-01-14 15:08:25,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 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-01-14 15:08:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-01-14 15:08:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-01-14 15:08:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-01-14 15:08:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2019-01-14 15:08:25,917 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2019-01-14 15:08:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:25,918 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2019-01-14 15:08:25,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2019-01-14 15:08:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:08:25,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:25,922 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:25,923 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:25,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:25,923 INFO L82 PathProgramCache]: Analyzing trace with hash 465583256, now seen corresponding path program 1 times [2019-01-14 15:08:25,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:25,924 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:08:25,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:27,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:27,425 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 15:08:27,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2019-01-14 15:08:27,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2019-01-14 15:08:27,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-14 15:08:27,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-14 15:08:27,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2019-01-14 15:08:27,691 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2019-01-14 15:08:27,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 15:08:27,921 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:28,119 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:28,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:28,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-01-14 15:08:28,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-01-14 15:08:28,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 53 [2019-01-14 15:08:28,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 64 [2019-01-14 15:08:28,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,482 INFO L303 Elim1Store]: Index analysis took 206 ms [2019-01-14 15:08:28,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2019-01-14 15:08:28,485 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:28,694 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:28,844 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:28,971 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:29,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-01-14 15:08:29,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,488 INFO L303 Elim1Store]: Index analysis took 321 ms [2019-01-14 15:08:29,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 69 [2019-01-14 15:08:29,868 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2019-01-14 15:08:30,286 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:08:30,412 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:08:30,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-14 15:08:30,615 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:61, output treesize:80 [2019-01-14 15:08:30,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:30,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2019-01-14 15:08:30,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:30,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:30,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2019-01-14 15:08:30,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:30,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:30,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:31,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 65 [2019-01-14 15:08:31,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:31,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:31,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2019-01-14 15:08:31,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:31,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:31,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:31,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:31,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:31,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 82 [2019-01-14 15:08:31,249 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2019-01-14 15:08:31,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:08:31,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 15:08:31,500 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:92 [2019-01-14 15:08:31,784 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 15:08:31,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 15:08:31,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 15:08:31,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:31,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:31,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:31,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 15:08:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 15:08:31,924 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:31,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:31,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 15:08:31,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:08:31,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:08:31,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:08:31,935 INFO L87 Difference]: Start difference. First operand 515 states and 762 transitions. Second operand 7 states. [2019-01-14 15:08:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:49,302 INFO L93 Difference]: Finished difference Result 1007 states and 1489 transitions. [2019-01-14 15:08:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:08:49,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-01-14 15:08:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:49,309 INFO L225 Difference]: With dead ends: 1007 [2019-01-14 15:08:49,309 INFO L226 Difference]: Without dead ends: 598 [2019-01-14 15:08:49,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:08:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-01-14 15:08:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 523. [2019-01-14 15:08:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-01-14 15:08:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 775 transitions. [2019-01-14 15:08:49,331 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 775 transitions. Word has length 98 [2019-01-14 15:08:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:49,331 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 775 transitions. [2019-01-14 15:08:49,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:08:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 775 transitions. [2019-01-14 15:08:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 15:08:49,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:49,334 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:49,335 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:49,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:49,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2076572589, now seen corresponding path program 1 times [2019-01-14 15:08:49,336 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:49,336 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:08:49,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:50,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:50,727 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 15:08:50,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2019-01-14 15:08:50,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2019-01-14 15:08:50,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:50,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-14 15:08:50,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:50,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:50,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:50,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-14 15:08:50,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:50,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:50,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:50,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2019-01-14 15:08:50,969 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,006 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,042 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2019-01-14 15:08:51,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 15:08:51,105 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,126 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-01-14 15:08:51,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-01-14 15:08:51,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 53 [2019-01-14 15:08:51,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 64 [2019-01-14 15:08:51,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2019-01-14 15:08:51,311 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,351 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,384 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,414 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:51,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-01-14 15:08:51,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:51,746 INFO L303 Elim1Store]: Index analysis took 282 ms [2019-01-14 15:08:51,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 69 [2019-01-14 15:08:51,852 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2019-01-14 15:08:52,268 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:08:52,352 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:08:52,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2019-01-14 15:08:52,493 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:61, output treesize:102 [2019-01-14 15:08:52,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:52,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 65 [2019-01-14 15:08:52,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:52,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:52,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2019-01-14 15:08:52,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:52,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:52,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:52,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:52,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:52,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 82 [2019-01-14 15:08:52,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 15:08:53,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:08:53,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:53,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2019-01-14 15:08:53,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:53,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:53,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2019-01-14 15:08:53,203 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:53,212 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:53,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 15:08:53,298 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:92 [2019-01-14 15:08:53,498 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 15:08:53,646 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 15:08:53,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 15:08:53,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 15:08:53,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:53,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:53,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:53,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 15:08:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 15:08:53,751 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:53,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:53,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 15:08:53,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:08:53,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:08:53,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:08:53,758 INFO L87 Difference]: Start difference. First operand 523 states and 775 transitions. Second operand 7 states. [2019-01-14 15:09:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:12,116 INFO L93 Difference]: Finished difference Result 1004 states and 1485 transitions. [2019-01-14 15:09:12,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:09:12,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-01-14 15:09:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:12,123 INFO L225 Difference]: With dead ends: 1004 [2019-01-14 15:09:12,123 INFO L226 Difference]: Without dead ends: 595 [2019-01-14 15:09:12,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:09:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-01-14 15:09:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 524. [2019-01-14 15:09:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-01-14 15:09:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 776 transitions. [2019-01-14 15:09:12,147 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 776 transitions. Word has length 99 [2019-01-14 15:09:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:12,147 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 776 transitions. [2019-01-14 15:09:12,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:09:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 776 transitions. [2019-01-14 15:09:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 15:09:12,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:12,150 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:12,150 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:12,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1811187728, now seen corresponding path program 1 times [2019-01-14 15:09:12,152 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:09:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:09:12,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:12,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:09:12,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 15:09:12,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:09:12,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:12,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:12,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:12,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-01-14 15:09:12,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 15:09:13,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:13,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:13,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:09:13,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:13,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:13,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:13,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-01-14 15:09:13,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 15:09:13,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:13,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-01-14 15:09:13,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:13,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:13,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:13,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-01-14 15:09:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-14 15:09:13,233 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:09:13,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:13,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:09:13,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:09:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:09:13,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:09:13,239 INFO L87 Difference]: Start difference. First operand 524 states and 776 transitions. Second operand 6 states. [2019-01-14 15:09:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:23,062 INFO L93 Difference]: Finished difference Result 1403 states and 2079 transitions. [2019-01-14 15:09:23,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:09:23,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-01-14 15:09:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:23,069 INFO L225 Difference]: With dead ends: 1403 [2019-01-14 15:09:23,069 INFO L226 Difference]: Without dead ends: 895 [2019-01-14 15:09:23,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:09:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-01-14 15:09:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 608. [2019-01-14 15:09:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-01-14 15:09:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 916 transitions. [2019-01-14 15:09:23,101 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 916 transitions. Word has length 112 [2019-01-14 15:09:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:23,103 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 916 transitions. [2019-01-14 15:09:23,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:09:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 916 transitions. [2019-01-14 15:09:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 15:09:23,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:23,107 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:23,107 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2019-01-14 15:09:23,109 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:09:23,109 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:09:23,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:09:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:09:32,454 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:09:32,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:09:32 BoogieIcfgContainer [2019-01-14 15:09:32,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:09:32,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:09:32,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:09:32,616 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:09:32,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:17" (3/4) ... [2019-01-14 15:09:32,621 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:09:32,784 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:09:32,784 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:09:32,786 INFO L168 Benchmark]: Toolchain (without parser) took 81577.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.8 MB). Free memory was 946.0 MB in the beginning and 974.5 MB in the end (delta: -28.5 MB). Peak memory consumption was 258.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:32,787 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:09:32,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 956.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:32,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.53 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-01-14 15:09:32,788 INFO L168 Benchmark]: Boogie Preprocessor took 109.87 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-01-14 15:09:32,788 INFO L168 Benchmark]: RCFGBuilder took 5158.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:32,788 INFO L168 Benchmark]: TraceAbstraction took 75086.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.0 GB in the beginning and 992.1 MB in the end (delta: 29.7 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:32,789 INFO L168 Benchmark]: Witness Printer took 168.66 ms. Allocated memory is still 1.3 GB. Free memory was 992.1 MB in the beginning and 974.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:32,793 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 956.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.53 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. * Boogie Preprocessor took 109.87 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 5158.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75086.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.0 GB in the beginning and 992.1 MB in the end (delta: 29.7 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. * Witness Printer took 168.66 ms. Allocated memory is still 1.3 GB. Free memory was 992.1 MB in the beginning and 974.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={280:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [init=1, SSLv3_client_data={280:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={280:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={280:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [init=1, SSLv3_client_data={280:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={280:0}] [L1249] EXPR s->version VAL [init=1, SSLv3_client_data={280:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [init=1, SSLv3_client_data={280:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={280:0}] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [init=1, SSLv3_client_data={280:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={280:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={280:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={280:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [init=1, SSLv3_client_data={280:0}] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [init=1, SSLv3_client_data={280:0}] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={280:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={280:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={280:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [init=1, SSLv3_client_data={280:0}] [L1320] COND FALSE !(ret <= 0) [L1325] s->hit VAL [init=1, SSLv3_client_data={280:0}] [L1325] COND FALSE !(s->hit) [L1328] s->state = 4400 VAL [init=1, SSLv3_client_data={280:0}] [L1330] s->init_num = 0 VAL [init=1, SSLv3_client_data={280:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={280:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={280:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={280:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1160] COND TRUE s->state == 4400 [L1334] EXPR s->s3 [L1334] EXPR (s->s3)->tmp.new_cipher [L1334] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={280:0}] [L1334] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1337] ret = __VERIFIER_nondet_int() [L1338] COND TRUE blastFlag == 2 [L1339] blastFlag = 3 VAL [init=1, SSLv3_client_data={280:0}] [L1347] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={280:0}] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [init=1, SSLv3_client_data={280:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={280:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={280:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={280:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [init=1, SSLv3_client_data={280:0}] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [init=1, SSLv3_client_data={280:0}] [L1371] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={280:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={280:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={280:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={280:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={280:0}] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={280:0}] [L1643] __VERIFIER_error() VAL [init=1, SSLv3_client_data={280:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. UNSAFE Result, 75.0s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 52.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1524 SDtfs, 1278 SDslu, 1645 SDs, 0 SdLazy, 1246 SolverSat, 69 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 50.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 433 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 618 NumberOfCodeBlocks, 618 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 499 ConstructedInterpolants, 12 QuantifiedInterpolants, 209535 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1743 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 487/487 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...