./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh/s3_clnt.blast.03_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.03_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 1420a5dac3676d838e2b742b3a84faa6df74a9e1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.03_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 1420a5dac3676d838e2b742b3a84faa6df74a9e1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:43,466 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:07:43,468 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:07:43,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:07:43,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:07:43,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:07:43,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:07:43,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:07:43,493 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:07:43,494 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:07:43,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:07:43,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:07:43,499 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:07:43,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:07:43,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:07:43,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:07:43,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:07:43,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:07:43,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:07:43,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:07:43,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:07:43,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:07:43,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:07:43,537 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:07:43,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:07:43,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:07:43,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:07:43,543 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:07:43,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:07:43,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:07:43,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:07:43,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:07:43,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:07:43,549 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:07:43,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:07:43,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:07:43,555 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:43,581 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:07:43,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:07:43,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:07:43,586 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:07:43,586 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:07:43,586 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:07:43,586 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:07:43,587 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:07:43,587 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:07:43,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:07:43,587 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:07:43,587 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:07:43,587 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:07:43,588 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:07:43,590 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:07:43,590 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:07:43,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:07:43,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:07:43,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:07:43,590 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:07:43,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:07:43,593 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:07:43,593 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:07:43,593 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:07:43,593 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:07:43,594 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:07:43,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:07:43,594 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 -> 1420a5dac3676d838e2b742b3a84faa6df74a9e1 [2019-01-14 15:07:43,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:07:43,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:07:43,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:07:43,671 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:07:43,671 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:07:43,673 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c [2019-01-14 15:07:43,732 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82b7216e/0533111bbd68496b92d555d85a76414a/FLAGf5a284db7 [2019-01-14 15:07:44,362 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:07:44,365 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c [2019-01-14 15:07:44,396 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82b7216e/0533111bbd68496b92d555d85a76414a/FLAGf5a284db7 [2019-01-14 15:07:44,578 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82b7216e/0533111bbd68496b92d555d85a76414a [2019-01-14 15:07:44,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:07:44,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:07:44,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:07:44,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:07:44,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:07:44,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:07:44" (1/1) ... [2019-01-14 15:07:44,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9cdb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:44, skipping insertion in model container [2019-01-14 15:07:44,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:07:44" (1/1) ... [2019-01-14 15:07:44,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:07:44,686 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:07:45,265 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:07:45,304 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:07:45,610 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:07:45,634 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:07:45,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:45 WrapperNode [2019-01-14 15:07:45,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:07:45,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:07:45,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:07:45,636 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:07:45,646 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:45" (1/1) ... [2019-01-14 15:07:45,693 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:45" (1/1) ... [2019-01-14 15:07:45,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:07:45,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:07:45,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:07:45,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:07:45,759 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:45" (1/1) ... [2019-01-14 15:07:45,759 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:45" (1/1) ... [2019-01-14 15:07:45,771 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:45" (1/1) ... [2019-01-14 15:07:45,773 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:45" (1/1) ... [2019-01-14 15:07:45,813 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:45" (1/1) ... [2019-01-14 15:07:45,824 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:45" (1/1) ... [2019-01-14 15:07:45,828 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:45" (1/1) ... [2019-01-14 15:07:45,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:07:45,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:07:45,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:07:45,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:07:45,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 15:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:07:45,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:07:45,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:07:46,177 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:07:47,805 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 15:07:47,806 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 15:07:47,807 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:07:47,808 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:07:47,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:47 BoogieIcfgContainer [2019-01-14 15:07:47,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:07:47,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:07:47,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:07:47,813 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:07:47,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:07:44" (1/3) ... [2019-01-14 15:07:47,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a95caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:07:47, skipping insertion in model container [2019-01-14 15:07:47,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:45" (2/3) ... [2019-01-14 15:07:47,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a95caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:07:47, skipping insertion in model container [2019-01-14 15:07:47,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:47" (3/3) ... [2019-01-14 15:07:47,817 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03_false-unreach-call.i.cil.c [2019-01-14 15:07:47,827 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:07:47,835 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:07:47,852 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:07:47,884 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:07:47,885 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:07:47,885 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:07:47,885 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:07:47,885 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:07:47,886 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:07:47,886 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:07:47,886 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:07:47,886 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:07:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-01-14 15:07:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 15:07:47,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:47,915 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:47,918 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:47,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:47,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-01-14 15:07:47,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:47,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:47,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:47,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:47,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:48,314 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:48,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:07:48,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:07:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:07:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:07:48,343 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2019-01-14 15:07:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:48,714 INFO L93 Difference]: Finished difference Result 369 states and 623 transitions. [2019-01-14 15:07:48,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:07:48,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 15:07:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:48,734 INFO L225 Difference]: With dead ends: 369 [2019-01-14 15:07:48,734 INFO L226 Difference]: Without dead ends: 213 [2019-01-14 15:07:48,739 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:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-14 15:07:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-14 15:07:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-14 15:07:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2019-01-14 15:07:48,804 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2019-01-14 15:07:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:48,804 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2019-01-14 15:07:48,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:07:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2019-01-14 15:07:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 15:07:48,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:48,808 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:48,808 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:48,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1192110763, now seen corresponding path program 1 times [2019-01-14 15:07:48,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:48,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:49,057 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,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:49,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:49,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:49,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:49,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:49,061 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand 4 states. [2019-01-14 15:07:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:50,304 INFO L93 Difference]: Finished difference Result 354 states and 530 transitions. [2019-01-14 15:07:50,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:50,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-14 15:07:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:50,308 INFO L225 Difference]: With dead ends: 354 [2019-01-14 15:07:50,308 INFO L226 Difference]: Without dead ends: 249 [2019-01-14 15:07:50,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-14 15:07:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2019-01-14 15:07:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2019-01-14 15:07:50,330 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 39 [2019-01-14 15:07:50,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:50,331 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2019-01-14 15:07:50,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2019-01-14 15:07:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 15:07:50,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:50,334 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,335 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash -48955901, now seen corresponding path program 1 times [2019-01-14 15:07:50,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:50,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:50,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:50,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:50,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:50,545 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,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:50,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:50,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:50,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:50,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:50,547 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand 4 states. [2019-01-14 15:07:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:51,300 INFO L93 Difference]: Finished difference Result 371 states and 558 transitions. [2019-01-14 15:07:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:51,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-14 15:07:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:51,305 INFO L225 Difference]: With dead ends: 371 [2019-01-14 15:07:51,305 INFO L226 Difference]: Without dead ends: 248 [2019-01-14 15:07:51,306 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:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-14 15:07:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 231. [2019-01-14 15:07:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 346 transitions. [2019-01-14 15:07:51,326 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 346 transitions. Word has length 53 [2019-01-14 15:07:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:51,327 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 346 transitions. [2019-01-14 15:07:51,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 346 transitions. [2019-01-14 15:07:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 15:07:51,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:51,333 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,334 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:51,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:51,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1157936347, now seen corresponding path program 1 times [2019-01-14 15:07:51,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:51,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:51,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:51,557 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,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:51,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:51,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:51,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:51,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:51,559 INFO L87 Difference]: Start difference. First operand 231 states and 346 transitions. Second operand 4 states. [2019-01-14 15:07:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:52,070 INFO L93 Difference]: Finished difference Result 371 states and 556 transitions. [2019-01-14 15:07:52,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:52,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-14 15:07:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:52,076 INFO L225 Difference]: With dead ends: 371 [2019-01-14 15:07:52,077 INFO L226 Difference]: Without dead ends: 248 [2019-01-14 15:07:52,078 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:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-14 15:07:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 231. [2019-01-14 15:07:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 345 transitions. [2019-01-14 15:07:52,094 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 345 transitions. Word has length 53 [2019-01-14 15:07:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:52,095 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 345 transitions. [2019-01-14 15:07:52,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 345 transitions. [2019-01-14 15:07:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 15:07:52,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:52,099 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,099 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:52,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:52,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1481895382, now seen corresponding path program 1 times [2019-01-14 15:07:52,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:52,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:52,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:52,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:52,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:52,230 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,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:52,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:52,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:52,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:52,232 INFO L87 Difference]: Start difference. First operand 231 states and 345 transitions. Second operand 4 states. [2019-01-14 15:07:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:52,763 INFO L93 Difference]: Finished difference Result 371 states and 554 transitions. [2019-01-14 15:07:52,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:52,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-14 15:07:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:52,766 INFO L225 Difference]: With dead ends: 371 [2019-01-14 15:07:52,767 INFO L226 Difference]: Without dead ends: 248 [2019-01-14 15:07:52,767 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:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-14 15:07:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 231. [2019-01-14 15:07:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 344 transitions. [2019-01-14 15:07:52,779 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 344 transitions. Word has length 54 [2019-01-14 15:07:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:52,780 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 344 transitions. [2019-01-14 15:07:52,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 344 transitions. [2019-01-14 15:07:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 15:07:52,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:52,782 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:52,782 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:52,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:52,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1416857056, now seen corresponding path program 1 times [2019-01-14 15:07:52,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:52,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:52,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:52,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:52,993 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:52,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:52,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:52,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:52,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:52,995 INFO L87 Difference]: Start difference. First operand 231 states and 344 transitions. Second operand 4 states. [2019-01-14 15:07:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:53,506 INFO L93 Difference]: Finished difference Result 371 states and 552 transitions. [2019-01-14 15:07:53,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:53,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-14 15:07:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:53,509 INFO L225 Difference]: With dead ends: 371 [2019-01-14 15:07:53,509 INFO L226 Difference]: Without dead ends: 248 [2019-01-14 15:07:53,510 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:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-14 15:07:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 231. [2019-01-14 15:07:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 343 transitions. [2019-01-14 15:07:53,520 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 343 transitions. Word has length 55 [2019-01-14 15:07:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:53,520 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 343 transitions. [2019-01-14 15:07:53,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 343 transitions. [2019-01-14 15:07:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 15:07:53,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:53,524 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:53,524 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1140450053, now seen corresponding path program 1 times [2019-01-14 15:07:53,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:53,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:53,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:53,824 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:53,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:53,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:53,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:53,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:53,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:53,835 INFO L87 Difference]: Start difference. First operand 231 states and 343 transitions. Second operand 4 states. [2019-01-14 15:07:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:54,483 INFO L93 Difference]: Finished difference Result 362 states and 539 transitions. [2019-01-14 15:07:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:54,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-14 15:07:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:54,485 INFO L225 Difference]: With dead ends: 362 [2019-01-14 15:07:54,485 INFO L226 Difference]: Without dead ends: 239 [2019-01-14 15:07:54,486 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:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-14 15:07:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 231. [2019-01-14 15:07:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 15:07:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 342 transitions. [2019-01-14 15:07:54,497 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 342 transitions. Word has length 56 [2019-01-14 15:07:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:54,498 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 342 transitions. [2019-01-14 15:07:54,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 342 transitions. [2019-01-14 15:07:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 15:07:54,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:54,501 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,501 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1499463818, now seen corresponding path program 1 times [2019-01-14 15:07:54,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:54,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:54,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:54,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:54,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:54,628 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,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:54,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:07:54,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:07:54,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:07:54,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:07:54,631 INFO L87 Difference]: Start difference. First operand 231 states and 342 transitions. Second operand 3 states. [2019-01-14 15:07:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:54,881 INFO L93 Difference]: Finished difference Result 475 states and 707 transitions. [2019-01-14 15:07:54,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:07:54,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-14 15:07:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:54,885 INFO L225 Difference]: With dead ends: 475 [2019-01-14 15:07:54,885 INFO L226 Difference]: Without dead ends: 352 [2019-01-14 15:07:54,886 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,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-01-14 15:07:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-01-14 15:07:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-01-14 15:07:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 521 transitions. [2019-01-14 15:07:54,901 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 521 transitions. Word has length 57 [2019-01-14 15:07:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:54,902 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 521 transitions. [2019-01-14 15:07:54,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:07:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 521 transitions. [2019-01-14 15:07:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:07:54,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:54,903 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,904 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:54,904 INFO L82 PathProgramCache]: Analyzing trace with hash -817434927, now seen corresponding path program 1 times [2019-01-14 15:07:54,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:54,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:54,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:54,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:54,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:55,211 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,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:55,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:55,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:55,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:55,212 INFO L87 Difference]: Start difference. First operand 352 states and 521 transitions. Second operand 4 states. [2019-01-14 15:07:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:56,592 INFO L93 Difference]: Finished difference Result 974 states and 1448 transitions. [2019-01-14 15:07:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:56,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 15:07:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:56,597 INFO L225 Difference]: With dead ends: 974 [2019-01-14 15:07:56,597 INFO L226 Difference]: Without dead ends: 629 [2019-01-14 15:07:56,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-01-14 15:07:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 415. [2019-01-14 15:07:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-01-14 15:07:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 626 transitions. [2019-01-14 15:07:56,616 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 626 transitions. Word has length 77 [2019-01-14 15:07:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:56,616 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 626 transitions. [2019-01-14 15:07:56,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 626 transitions. [2019-01-14 15:07:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:07:56,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:56,620 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,620 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1428144527, now seen corresponding path program 1 times [2019-01-14 15:07:56,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:56,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:56,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:56,897 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,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:56,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:56,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:56,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:56,899 INFO L87 Difference]: Start difference. First operand 415 states and 626 transitions. Second operand 4 states. [2019-01-14 15:07:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:57,343 INFO L93 Difference]: Finished difference Result 966 states and 1455 transitions. [2019-01-14 15:07:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:57,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 15:07:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:57,351 INFO L225 Difference]: With dead ends: 966 [2019-01-14 15:07:57,356 INFO L226 Difference]: Without dead ends: 558 [2019-01-14 15:07:57,358 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:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-14 15:07:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 481. [2019-01-14 15:07:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:07:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 740 transitions. [2019-01-14 15:07:57,379 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 740 transitions. Word has length 77 [2019-01-14 15:07:57,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:57,380 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 740 transitions. [2019-01-14 15:07:57,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 740 transitions. [2019-01-14 15:07:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 15:07:57,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:57,385 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,386 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 823309799, now seen corresponding path program 1 times [2019-01-14 15:07:57,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:57,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:57,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:57,694 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,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:57,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:57,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:57,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:57,696 INFO L87 Difference]: Start difference. First operand 481 states and 740 transitions. Second operand 4 states. [2019-01-14 15:07:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:58,150 INFO L93 Difference]: Finished difference Result 1029 states and 1563 transitions. [2019-01-14 15:07:58,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:58,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-14 15:07:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:58,158 INFO L225 Difference]: With dead ends: 1029 [2019-01-14 15:07:58,159 INFO L226 Difference]: Without dead ends: 555 [2019-01-14 15:07:58,161 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:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-01-14 15:07:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 481. [2019-01-14 15:07:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:07:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 737 transitions. [2019-01-14 15:07:58,181 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 737 transitions. Word has length 91 [2019-01-14 15:07:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:58,181 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-01-14 15:07:58,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 737 transitions. [2019-01-14 15:07:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 15:07:58,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:58,184 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:07:58,185 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:58,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:58,185 INFO L82 PathProgramCache]: Analyzing trace with hash -285670647, now seen corresponding path program 1 times [2019-01-14 15:07:58,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:58,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:58,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:58,421 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:07:58,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:58,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:58,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:58,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:58,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:58,425 INFO L87 Difference]: Start difference. First operand 481 states and 737 transitions. Second operand 4 states. [2019-01-14 15:07:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:59,198 INFO L93 Difference]: Finished difference Result 1029 states and 1557 transitions. [2019-01-14 15:07:59,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:07:59,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-14 15:07:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:59,204 INFO L225 Difference]: With dead ends: 1029 [2019-01-14 15:07:59,205 INFO L226 Difference]: Without dead ends: 555 [2019-01-14 15:07:59,206 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:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-01-14 15:07:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 481. [2019-01-14 15:07:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:07:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 734 transitions. [2019-01-14 15:07:59,229 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 734 transitions. Word has length 91 [2019-01-14 15:07:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:59,230 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 734 transitions. [2019-01-14 15:07:59,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:07:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 734 transitions. [2019-01-14 15:07:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 15:07:59,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:59,233 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:07:59,234 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:59,234 INFO L82 PathProgramCache]: Analyzing trace with hash -211462458, now seen corresponding path program 1 times [2019-01-14 15:07:59,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:07:59,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:07:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:59,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:07:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:59,559 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:07:59,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:59,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:07:59,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:07:59,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:07:59,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:07:59,563 INFO L87 Difference]: Start difference. First operand 481 states and 734 transitions. Second operand 4 states. [2019-01-14 15:08:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:00,316 INFO L93 Difference]: Finished difference Result 1029 states and 1551 transitions. [2019-01-14 15:08:00,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:00,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-14 15:08:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:00,322 INFO L225 Difference]: With dead ends: 1029 [2019-01-14 15:08:00,323 INFO L226 Difference]: Without dead ends: 555 [2019-01-14 15:08:00,324 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:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-01-14 15:08:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 481. [2019-01-14 15:08:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 731 transitions. [2019-01-14 15:08:00,369 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 731 transitions. Word has length 92 [2019-01-14 15:08:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:00,369 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 731 transitions. [2019-01-14 15:08:00,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 731 transitions. [2019-01-14 15:08:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 15:08:00,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:00,372 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:00,373 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:00,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2145572036, now seen corresponding path program 1 times [2019-01-14 15:08:00,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:00,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:00,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:00,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:00,687 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:00,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:00,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:00,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:00,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:00,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:00,689 INFO L87 Difference]: Start difference. First operand 481 states and 731 transitions. Second operand 4 states. [2019-01-14 15:08:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:01,229 INFO L93 Difference]: Finished difference Result 1029 states and 1545 transitions. [2019-01-14 15:08:01,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:01,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-14 15:08:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:01,235 INFO L225 Difference]: With dead ends: 1029 [2019-01-14 15:08:01,235 INFO L226 Difference]: Without dead ends: 555 [2019-01-14 15:08:01,236 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:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-01-14 15:08:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 481. [2019-01-14 15:08:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 728 transitions. [2019-01-14 15:08:01,256 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 728 transitions. Word has length 93 [2019-01-14 15:08:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:01,257 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 728 transitions. [2019-01-14 15:08:01,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 728 transitions. [2019-01-14 15:08:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-14 15:08:01,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:01,260 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:01,260 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:01,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2039189343, now seen corresponding path program 1 times [2019-01-14 15:08:01,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:01,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:01,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:01,561 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:01,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:01,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:01,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:01,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:01,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:01,562 INFO L87 Difference]: Start difference. First operand 481 states and 728 transitions. Second operand 4 states. [2019-01-14 15:08:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:02,644 INFO L93 Difference]: Finished difference Result 1002 states and 1506 transitions. [2019-01-14 15:08:02,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:02,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-14 15:08:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:02,653 INFO L225 Difference]: With dead ends: 1002 [2019-01-14 15:08:02,653 INFO L226 Difference]: Without dead ends: 528 [2019-01-14 15:08:02,655 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:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-01-14 15:08:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 481. [2019-01-14 15:08:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 725 transitions. [2019-01-14 15:08:02,678 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 725 transitions. Word has length 94 [2019-01-14 15:08:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:02,678 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 725 transitions. [2019-01-14 15:08:02,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:02,678 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 725 transitions. [2019-01-14 15:08:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 15:08:02,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:02,682 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, 1] [2019-01-14 15:08:02,683 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash -898325713, now seen corresponding path program 1 times [2019-01-14 15:08:02,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:02,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:02,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:02,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:02,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:02,861 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:02,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:02,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:02,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:02,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:02,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:02,863 INFO L87 Difference]: Start difference. First operand 481 states and 725 transitions. Second operand 4 states. [2019-01-14 15:08:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:03,361 INFO L93 Difference]: Finished difference Result 1002 states and 1500 transitions. [2019-01-14 15:08:03,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:03,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-14 15:08:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:03,365 INFO L225 Difference]: With dead ends: 1002 [2019-01-14 15:08:03,365 INFO L226 Difference]: Without dead ends: 528 [2019-01-14 15:08:03,367 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:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-01-14 15:08:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 481. [2019-01-14 15:08:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 722 transitions. [2019-01-14 15:08:03,386 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 722 transitions. Word has length 96 [2019-01-14 15:08:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:03,387 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 722 transitions. [2019-01-14 15:08:03,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 722 transitions. [2019-01-14 15:08:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 15:08:03,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:03,390 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, 1] [2019-01-14 15:08:03,390 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash 411670386, now seen corresponding path program 1 times [2019-01-14 15:08:03,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:03,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:03,487 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:03,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:03,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:03,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:03,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:03,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:03,489 INFO L87 Difference]: Start difference. First operand 481 states and 722 transitions. Second operand 4 states. [2019-01-14 15:08:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:03,890 INFO L93 Difference]: Finished difference Result 987 states and 1473 transitions. [2019-01-14 15:08:03,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:03,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-01-14 15:08:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:03,893 INFO L225 Difference]: With dead ends: 987 [2019-01-14 15:08:03,894 INFO L226 Difference]: Without dead ends: 513 [2019-01-14 15:08:03,895 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:08:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-01-14 15:08:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 481. [2019-01-14 15:08:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 15:08:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 719 transitions. [2019-01-14 15:08:03,912 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 719 transitions. Word has length 97 [2019-01-14 15:08:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:03,913 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 719 transitions. [2019-01-14 15:08:03,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 719 transitions. [2019-01-14 15:08:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:08:03,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:03,915 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:03,915 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash -763564720, now seen corresponding path program 1 times [2019-01-14 15:08:03,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:03,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:03,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:03,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:04,107 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 15:08:04,165 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:04,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:04,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:08:04,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:08:04,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:08:04,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:08:04,167 INFO L87 Difference]: Start difference. First operand 481 states and 719 transitions. Second operand 6 states. [2019-01-14 15:08:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:05,016 INFO L93 Difference]: Finished difference Result 896 states and 1337 transitions. [2019-01-14 15:08:05,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:08:05,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-01-14 15:08:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:05,021 INFO L225 Difference]: With dead ends: 896 [2019-01-14 15:08:05,021 INFO L226 Difference]: Without dead ends: 564 [2019-01-14 15:08:05,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:08:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-01-14 15:08:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 489. [2019-01-14 15:08:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-01-14 15:08:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 732 transitions. [2019-01-14 15:08:05,044 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 732 transitions. Word has length 98 [2019-01-14 15:08:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:05,044 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 732 transitions. [2019-01-14 15:08:05,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:08:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 732 transitions. [2019-01-14 15:08:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 15:08:05,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:05,048 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,048 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash 847424613, now seen corresponding path program 1 times [2019-01-14 15:08:05,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:05,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:05,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:05,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:05,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:05,273 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:05,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:05,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:08:05,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:08:05,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:08:05,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:08:05,275 INFO L87 Difference]: Start difference. First operand 489 states and 732 transitions. Second operand 6 states. [2019-01-14 15:08:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:06,162 INFO L93 Difference]: Finished difference Result 893 states and 1333 transitions. [2019-01-14 15:08:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:08:06,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-01-14 15:08:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:06,168 INFO L225 Difference]: With dead ends: 893 [2019-01-14 15:08:06,169 INFO L226 Difference]: Without dead ends: 561 [2019-01-14 15:08:06,170 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:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-01-14 15:08:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 490. [2019-01-14 15:08:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-01-14 15:08:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 733 transitions. [2019-01-14 15:08:06,195 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 733 transitions. Word has length 99 [2019-01-14 15:08:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:06,196 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 733 transitions. [2019-01-14 15:08:06,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:08:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 733 transitions. [2019-01-14 15:08:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 15:08:06,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:06,201 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:06,201 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:06,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2019-01-14 15:08:06,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:06,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:06,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:06,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:06,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:08:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:08:06,888 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:08:07,052 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,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:08:07,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:08:07,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:08:07,053 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:08:07,053 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:47" (3/4) ... [2019-01-14 15:08:07,057 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 15:08:07,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:08:07,058 INFO L168 Benchmark]: Toolchain (without parser) took 22476.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -233.9 MB). Peak memory consumption was 84.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,059 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:08:07,060 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1051.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.46 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,061 INFO L168 Benchmark]: Boogie Preprocessor took 88.18 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,062 INFO L168 Benchmark]: RCFGBuilder took 1973.86 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: 83.5 MB). Peak memory consumption was 83.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,063 INFO L168 Benchmark]: TraceAbstraction took 19241.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -148.8 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:08:07,064 INFO L168 Benchmark]: Witness Printer took 5.09 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:08:07,069 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1051.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.46 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.18 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1973.86 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: 83.5 MB). Peak memory consumption was 83.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19241.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -148.8 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.09 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. 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 1338. 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}] [L1324] COND FALSE !(ret <= 0) [L1329] s->hit VAL [init=1, SSLv3_client_data={-4:0}] [L1329] COND FALSE !(s->hit) [L1332] s->state = 4400 VAL [init=1, SSLv3_client_data={-4:0}] [L1334] 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 [L1338] EXPR s->s3 [L1338] EXPR (s->s3)->tmp.new_cipher [L1338] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={-4:0}] [L1338] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 2 [L1343] 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.1s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3625 SDtfs, 1523 SDslu, 5142 SDs, 0 SdLazy, 2812 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 18 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.0s 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, 953 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1508 NumberOfCodeBlocks, 1508 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1377 ConstructedInterpolants, 0 QuantifiedInterpolants, 258473 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:09,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:08:09,456 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:08:09,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:08:09,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:08:09,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:08:09,471 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:08:09,472 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:08:09,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:08:09,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:08:09,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:08:09,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:08:09,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:08:09,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:08:09,479 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:08:09,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:08:09,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:08:09,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:08:09,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:08:09,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:08:09,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:08:09,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:08:09,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:08:09,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:08:09,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:08:09,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:08:09,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:08:09,496 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:08:09,497 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:08:09,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:08:09,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:08:09,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:08:09,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:08:09,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:08:09,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:08:09,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:08:09,506 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:09,533 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:08:09,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:08:09,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:08:09,535 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:08:09,536 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:08:09,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:08:09,536 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:08:09,536 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:08:09,537 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:08:09,537 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:08:09,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:08:09,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:08:09,537 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 15:08:09,537 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 15:08:09,537 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:08:09,540 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:08:09,540 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:08:09,540 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:08:09,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:08:09,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:08:09,541 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:08:09,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:08:09,543 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:08:09,543 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:08:09,544 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:08:09,544 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 15:08:09,544 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:08:09,545 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 15:08:09,545 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-14 15:08:09,545 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 -> 1420a5dac3676d838e2b742b3a84faa6df74a9e1 [2019-01-14 15:08:09,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:08:09,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:08:09,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:08:09,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:08:09,626 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:08:09,627 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c [2019-01-14 15:08:09,696 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce539fc4/2ad7ab4ee778426894351f098a212058/FLAG923c04d7a [2019-01-14 15:08:10,270 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:08:10,272 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c [2019-01-14 15:08:10,292 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce539fc4/2ad7ab4ee778426894351f098a212058/FLAG923c04d7a [2019-01-14 15:08:10,511 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce539fc4/2ad7ab4ee778426894351f098a212058 [2019-01-14 15:08:10,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:08:10,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:08:10,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:08:10,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:08:10,524 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:08:10,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:08:10" (1/1) ... [2019-01-14 15:08:10,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd00d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:10, skipping insertion in model container [2019-01-14 15:08:10,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:08:10" (1/1) ... [2019-01-14 15:08:10,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:08:10,633 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:08:11,126 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:08:11,257 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:08:11,478 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:08:11,512 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:08:11,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:11 WrapperNode [2019-01-14 15:08:11,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:08:11,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:08:11,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:08:11,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:08:11,528 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:11" (1/1) ... [2019-01-14 15:08:11,584 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:11" (1/1) ... [2019-01-14 15:08:11,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:08:11,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:08:11,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:08:11,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:08:11,699 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:11" (1/1) ... [2019-01-14 15:08:11,700 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:11" (1/1) ... [2019-01-14 15:08:11,723 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:11" (1/1) ... [2019-01-14 15:08:11,723 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:11" (1/1) ... [2019-01-14 15:08:11,790 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:11" (1/1) ... [2019-01-14 15:08:11,805 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:11" (1/1) ... [2019-01-14 15:08:11,809 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:11" (1/1) ... [2019-01-14 15:08:11,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:08:11,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:08:11,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:08:11,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:08:11,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:11" (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:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:08:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-01-14 15:08:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:08:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:08:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-14 15:08:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:08:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:08:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:08:11,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:08:11,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-14 15:08:12,214 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:08:16,878 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 15:08:16,879 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 15:08:16,880 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:08:16,880 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:08:16,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:16 BoogieIcfgContainer [2019-01-14 15:08:16,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:08:16,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:08:16,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:08:16,889 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:08:16,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:08:10" (1/3) ... [2019-01-14 15:08:16,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b033b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:08:16, skipping insertion in model container [2019-01-14 15:08:16,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:11" (2/3) ... [2019-01-14 15:08:16,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b033b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:08:16, skipping insertion in model container [2019-01-14 15:08:16,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:16" (3/3) ... [2019-01-14 15:08:16,895 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03_false-unreach-call.i.cil.c [2019-01-14 15:08:16,903 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:08:16,911 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:08:16,925 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:08:16,953 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:08:16,954 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:08:16,954 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:08:16,954 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:08:16,954 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:08:16,954 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:08:16,954 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:08:16,955 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:08:16,955 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:08:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-01-14 15:08:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 15:08:16,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:16,980 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:16,983 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-01-14 15:08:16,996 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:16,996 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,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:17,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:17,277 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,277 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2019-01-14 15:08:17,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:17,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:17,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:17,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:17,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:17,319 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2019-01-14 15:08:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:17,704 INFO L93 Difference]: Finished difference Result 369 states and 623 transitions. [2019-01-14 15:08:17,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:17,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 15:08:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:17,730 INFO L225 Difference]: With dead ends: 369 [2019-01-14 15:08:17,731 INFO L226 Difference]: Without dead ends: 213 [2019-01-14 15:08:17,735 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:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-14 15:08:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-14 15:08:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-14 15:08:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2019-01-14 15:08:17,796 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2019-01-14 15:08:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:17,796 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2019-01-14 15:08:17,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2019-01-14 15:08:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 15:08:17,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:17,801 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:17,801 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:17,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:17,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1192110763, now seen corresponding path program 1 times [2019-01-14 15:08:17,803 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:17,803 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:17,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:17,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:18,029 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,029 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:18,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:18,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:18,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:18,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:18,042 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand 3 states. [2019-01-14 15:08:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:20,228 INFO L93 Difference]: Finished difference Result 417 states and 626 transitions. [2019-01-14 15:08:20,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:20,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-14 15:08:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:20,233 INFO L225 Difference]: With dead ends: 417 [2019-01-14 15:08:20,234 INFO L226 Difference]: Without dead ends: 312 [2019-01-14 15:08:20,235 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,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-14 15:08:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-01-14 15:08:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-14 15:08:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 463 transitions. [2019-01-14 15:08:20,264 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 463 transitions. Word has length 39 [2019-01-14 15:08:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:20,265 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 463 transitions. [2019-01-14 15:08:20,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 463 transitions. [2019-01-14 15:08:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 15:08:20,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:20,271 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,271 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:20,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:20,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1499463818, now seen corresponding path program 1 times [2019-01-14 15:08:20,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:20,272 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,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:20,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:20,488 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:20,490 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:20,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:20,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:20,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:20,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:20,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:20,498 INFO L87 Difference]: Start difference. First operand 312 states and 463 transitions. Second operand 3 states. [2019-01-14 15:08:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:22,488 INFO L93 Difference]: Finished difference Result 618 states and 923 transitions. [2019-01-14 15:08:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:22,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-14 15:08:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:22,493 INFO L225 Difference]: With dead ends: 618 [2019-01-14 15:08:22,493 INFO L226 Difference]: Without dead ends: 414 [2019-01-14 15:08:22,495 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:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-14 15:08:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2019-01-14 15:08:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-01-14 15:08:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2019-01-14 15:08:22,531 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2019-01-14 15:08:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:22,532 INFO L480 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2019-01-14 15:08:22,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2019-01-14 15:08:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:08:22,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:22,545 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:22,545 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:22,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:22,546 INFO L82 PathProgramCache]: Analyzing trace with hash -817434927, now seen corresponding path program 1 times [2019-01-14 15:08:22,548 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:22,549 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:22,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:22,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:22,778 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:22,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:22,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:22,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:08:22,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:08:22,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:08:22,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:08:22,782 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand 3 states. [2019-01-14 15:08:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:24,981 INFO L93 Difference]: Finished difference Result 821 states and 1222 transitions. [2019-01-14 15:08:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:08:24,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-01-14 15:08:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:24,986 INFO L225 Difference]: With dead ends: 821 [2019-01-14 15:08:24,987 INFO L226 Difference]: Without dead ends: 515 [2019-01-14 15:08:24,988 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:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-01-14 15:08:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-01-14 15:08:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-01-14 15:08:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2019-01-14 15:08:25,009 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2019-01-14 15:08:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:25,009 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2019-01-14 15:08:25,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:08:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2019-01-14 15:08:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:08:25,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:25,014 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,014 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:25,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash 922615118, now seen corresponding path program 1 times [2019-01-14 15:08:25,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:25,015 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,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:26,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:26,770 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 15:08:26,859 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:26,868 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:26,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:26,894 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:26,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:26,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:26,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:26,967 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:26,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,048 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,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,079 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,101 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,120 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,191 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,196 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,197 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,223 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,245 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:27,264 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:27,278 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:27,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,317 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:27,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,381 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:27,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,502 INFO L303 Elim1Store]: Index analysis took 117 ms [2019-01-14 15:08:27,506 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:27,508 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,562 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,603 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,638 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:27,836 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:27,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:27,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,068 INFO L303 Elim1Store]: Index analysis took 229 ms [2019-01-14 15:08:28,197 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:28,200 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2019-01-14 15:08:28,392 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:08:28,489 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:28,656 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:28,656 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:61, output treesize:80 [2019-01-14 15:08:28,781 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-01-14 15:08:28,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,794 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:28,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:28,817 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:28,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:28,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:28,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,013 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:29,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,075 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:29,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:29,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:29,312 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:29,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2019-01-14 15:08:29,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:08:29,553 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:29,554 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:92 [2019-01-14 15:08:29,981 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 15:08:30,041 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:30,067 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:30,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:30,090 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,096 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:30,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 15:08:30,136 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:30,136 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:30,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:30,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 15:08:30,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:08:30,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:08:30,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:08:30,148 INFO L87 Difference]: Start difference. First operand 515 states and 762 transitions. Second operand 7 states. [2019-01-14 15:08:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:46,454 INFO L93 Difference]: Finished difference Result 1007 states and 1489 transitions. [2019-01-14 15:08:46,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:08:46,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-01-14 15:08:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:46,461 INFO L225 Difference]: With dead ends: 1007 [2019-01-14 15:08:46,461 INFO L226 Difference]: Without dead ends: 598 [2019-01-14 15:08:46,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:08:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-01-14 15:08:46,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 523. [2019-01-14 15:08:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-01-14 15:08:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 775 transitions. [2019-01-14 15:08:46,482 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 775 transitions. Word has length 98 [2019-01-14 15:08:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:46,483 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 775 transitions. [2019-01-14 15:08:46,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:08:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 775 transitions. [2019-01-14 15:08:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 15:08:46,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:46,486 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:46,487 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1761362845, now seen corresponding path program 1 times [2019-01-14 15:08:46,488 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:08:46,488 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:46,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:47,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:08:47,983 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 15:08:48,038 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:48,053 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:48,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,076 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:48,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,137 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:48,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,188 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:48,188 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:48,228 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:48,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:48,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:48,329 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:48,336 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:48,336 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:48,360 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:48,383 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:48,398 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:48,405 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:48,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,427 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:48,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,477 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:48,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,548 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:48,549 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:48,590 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:48,622 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:48,656 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:48,702 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:48,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:48,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:49,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:49,015 INFO L303 Elim1Store]: Index analysis took 310 ms [2019-01-14 15:08:49,233 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:49,235 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2019-01-14 15:08:49,369 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:08:49,459 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:49,621 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:49,622 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:61, output treesize:102 [2019-01-14 15:08:49,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:49,783 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:49,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:49,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:49,808 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:49,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:49,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:49,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:49,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:49,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:49,990 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:49,993 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 15:08:50,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:08:50,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:50,295 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:50,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:50,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:08:50,311 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:50,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:50,320 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:50,407 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:50,408 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:92 [2019-01-14 15:08:50,781 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 15:08:50,831 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:50,834 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:50,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:08:50,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:08:50,840 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:50,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 15:08:50,895 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:50,895 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:08:50,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:50,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 15:08:50,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:08:50,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:08:50,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:08:50,902 INFO L87 Difference]: Start difference. First operand 523 states and 775 transitions. Second operand 7 states. [2019-01-14 15:09:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:07,847 INFO L93 Difference]: Finished difference Result 1004 states and 1485 transitions. [2019-01-14 15:09:07,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:09:07,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-01-14 15:09:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:07,854 INFO L225 Difference]: With dead ends: 1004 [2019-01-14 15:09:07,856 INFO L226 Difference]: Without dead ends: 595 [2019-01-14 15:09:07,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:09:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-01-14 15:09:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 524. [2019-01-14 15:09:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-01-14 15:09:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 776 transitions. [2019-01-14 15:09:07,874 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 776 transitions. Word has length 99 [2019-01-14 15:09:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:07,875 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 776 transitions. [2019-01-14 15:09:07,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:09:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 776 transitions. [2019-01-14 15:09:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 15:09:07,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:07,879 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:07,879 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1354155866, now seen corresponding path program 1 times [2019-01-14 15:09:07,880 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:09:07,880 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:07,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:08,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:09:08,804 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:08,825 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:08,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:08,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:08,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:08,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-01-14 15:09:09,006 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:09,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:09,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:09,012 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:09,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:09,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:09,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:09,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-01-14 15:09:09,167 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:09,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:09,171 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:09,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:09,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:09,177 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:09,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-01-14 15:09:09,201 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:09,201 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:09:09,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:09,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:09:09,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:09:09,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:09:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:09:09,206 INFO L87 Difference]: Start difference. First operand 524 states and 776 transitions. Second operand 6 states. [2019-01-14 15:09:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:19,577 INFO L93 Difference]: Finished difference Result 1404 states and 2080 transitions. [2019-01-14 15:09:19,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:09:19,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-01-14 15:09:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:19,586 INFO L225 Difference]: With dead ends: 1404 [2019-01-14 15:09:19,586 INFO L226 Difference]: Without dead ends: 896 [2019-01-14 15:09:19,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:09:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-01-14 15:09:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 608. [2019-01-14 15:09:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-01-14 15:09:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 916 transitions. [2019-01-14 15:09:19,617 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 916 transitions. Word has length 112 [2019-01-14 15:09:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:19,620 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 916 transitions. [2019-01-14 15:09:19,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:09:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 916 transitions. [2019-01-14 15:09:19,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 15:09:19,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:19,623 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:19,623 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:19,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:19,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2019-01-14 15:09:19,625 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:09:19,625 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:19,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:09:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:09:28,878 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:09:29,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:09:29 BoogieIcfgContainer [2019-01-14 15:09:29,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:09:29,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:09:29,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:09:29,066 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:09:29,067 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:16" (3/4) ... [2019-01-14 15:09:29,070 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:09:29,207 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:09:29,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:09:29,208 INFO L168 Benchmark]: Toolchain (without parser) took 78691.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 942.0 MB in the beginning and 1.0 GB in the end (delta: -78.1 MB). Peak memory consumption was 210.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:29,210 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:09:29,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 993.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:29,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:29,211 INFO L168 Benchmark]: Boogie Preprocessor took 143.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:29,211 INFO L168 Benchmark]: RCFGBuilder took 5055.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.6 MB in the end (delta: 90.0 MB). Peak memory consumption was 90.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:29,211 INFO L168 Benchmark]: TraceAbstraction took 72181.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 990.6 MB in the beginning and 1.0 GB in the end (delta: -47.9 MB). Peak memory consumption was 124.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:29,213 INFO L168 Benchmark]: Witness Printer took 142.07 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:09:29,216 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.42 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 993.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 168.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 143.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5055.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.6 MB in the end (delta: 90.0 MB). Peak memory consumption was 90.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 72181.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 990.6 MB in the beginning and 1.0 GB in the end (delta: -47.9 MB). Peak memory consumption was 124.1 MB. Max. memory is 11.5 GB. * Witness Printer took 142.07 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 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}] [L1324] COND FALSE !(ret <= 0) [L1329] s->hit VAL [init=1, SSLv3_client_data={280:0}] [L1329] COND FALSE !(s->hit) [L1332] s->state = 4400 VAL [init=1, SSLv3_client_data={280:0}] [L1334] 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 [L1338] EXPR s->s3 [L1338] EXPR (s->s3)->tmp.new_cipher [L1338] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={280:0}] [L1338] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 2 [L1343] 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, 72.1s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 50.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1524 SDtfs, 1193 SDslu, 1697 SDs, 0 SdLazy, 1285 SolverSat, 63 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 48.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.5s 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 434 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 7.4s SatisfiabilityAnalysisTime, 7.9s 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...