./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh/s3_clnt.blast.02_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.02_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 69033ce18a9d55d3b643fc421e26bf1667e81629 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.02_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 69033ce18a9d55d3b643fc421e26bf1667e81629 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:06:10,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:06:10,800 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:06:10,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:06:10,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:06:10,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:06:10,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:06:10,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:06:10,818 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:06:10,819 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:06:10,820 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:06:10,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:06:10,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:06:10,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:06:10,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:06:10,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:06:10,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:06:10,828 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:06:10,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:06:10,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:06:10,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:06:10,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:06:10,837 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:06:10,837 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:06:10,837 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:06:10,838 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:06:10,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:06:10,842 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:06:10,843 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:06:10,844 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:06:10,844 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:06:10,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:06:10,845 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:06:10,847 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:06:10,848 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:06:10,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:06:10,851 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:06:10,879 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:06:10,880 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:06:10,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:06:10,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:06:10,885 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:06:10,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:06:10,885 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:06:10,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:06:10,887 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:06:10,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:06:10,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:06:10,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:06:10,887 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:06:10,887 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:06:10,888 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:06:10,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:06:10,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:06:10,889 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:06:10,889 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:06:10,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:06:10,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:06:10,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:06:10,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:06:10,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:06:10,892 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:06:10,892 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:06:10,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:06:10,893 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 -> 69033ce18a9d55d3b643fc421e26bf1667e81629 [2019-01-14 15:06:10,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:06:10,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:06:10,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:06:10,958 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:06:10,958 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:06:10,959 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c [2019-01-14 15:06:11,020 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463d07c8a/8ab16279adf94db99523f10f361ff289/FLAG43f71b76d [2019-01-14 15:06:11,633 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:06:11,634 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c [2019-01-14 15:06:11,661 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463d07c8a/8ab16279adf94db99523f10f361ff289/FLAG43f71b76d [2019-01-14 15:06:11,882 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463d07c8a/8ab16279adf94db99523f10f361ff289 [2019-01-14 15:06:11,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:06:11,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:06:11,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:06:11,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:06:11,894 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:06:11,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:06:11" (1/1) ... [2019-01-14 15:06:11,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7129d1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:11, skipping insertion in model container [2019-01-14 15:06:11,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:06:11" (1/1) ... [2019-01-14 15:06:11,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:06:11,984 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:06:12,466 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:06:12,496 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:06:12,754 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:06:12,799 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:06:12,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:12 WrapperNode [2019-01-14 15:06:12,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:06:12,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:06:12,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:06:12,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:06:12,813 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:06:12" (1/1) ... [2019-01-14 15:06:12,866 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:06:12" (1/1) ... [2019-01-14 15:06:12,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:06:12,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:06:12,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:06:12,959 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:06:12,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:12" (1/1) ... [2019-01-14 15:06:12,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:12" (1/1) ... [2019-01-14 15:06:12,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:12" (1/1) ... [2019-01-14 15:06:13,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:12" (1/1) ... [2019-01-14 15:06:13,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:12" (1/1) ... [2019-01-14 15:06:13,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:12" (1/1) ... [2019-01-14 15:06:13,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:12" (1/1) ... [2019-01-14 15:06:13,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:06:13,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:06:13,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:06:13,107 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:06:13,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:06:13,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:06:13,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:06:13,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:06:13,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:06:13,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:06:13,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:06:13,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 15:06:13,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:06:13,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:06:13,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:06:13,455 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:06:15,128 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 15:06:15,129 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 15:06:15,131 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:06:15,132 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:06:15,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:06:15 BoogieIcfgContainer [2019-01-14 15:06:15,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:06:15,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:06:15,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:06:15,143 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:06:15,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:06:11" (1/3) ... [2019-01-14 15:06:15,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0a4485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:06:15, skipping insertion in model container [2019-01-14 15:06:15,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:12" (2/3) ... [2019-01-14 15:06:15,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0a4485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:06:15, skipping insertion in model container [2019-01-14 15:06:15,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:06:15" (3/3) ... [2019-01-14 15:06:15,150 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02_false-unreach-call.i.cil.c [2019-01-14 15:06:15,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:06:15,178 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:06:15,200 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:06:15,239 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:06:15,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:06:15,240 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:06:15,240 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:06:15,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:06:15,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:06:15,241 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:06:15,242 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:06:15,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:06:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-01-14 15:06:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 15:06:15,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:15,273 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:06:15,275 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-01-14 15:06:15,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:15,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:15,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:15,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:15,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:15,643 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:06:15,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:15,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:06:15,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:06:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:06:15,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:06:15,663 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2019-01-14 15:06:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:16,026 INFO L93 Difference]: Finished difference Result 368 states and 621 transitions. [2019-01-14 15:06:16,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:06:16,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 15:06:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:16,056 INFO L225 Difference]: With dead ends: 368 [2019-01-14 15:06:16,057 INFO L226 Difference]: Without dead ends: 212 [2019-01-14 15:06:16,063 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:06:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-14 15:06:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-01-14 15:06:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-14 15:06:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 316 transitions. [2019-01-14 15:06:16,169 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 316 transitions. Word has length 24 [2019-01-14 15:06:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:16,171 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 316 transitions. [2019-01-14 15:06:16,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:06:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 316 transitions. [2019-01-14 15:06:16,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 15:06:16,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:16,176 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:06:16,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:16,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1509035189, now seen corresponding path program 1 times [2019-01-14 15:06:16,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:16,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:16,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:16,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:16,431 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:06:16,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:16,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:16,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:16,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:16,435 INFO L87 Difference]: Start difference. First operand 212 states and 316 transitions. Second operand 4 states. [2019-01-14 15:06:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:17,405 INFO L93 Difference]: Finished difference Result 353 states and 529 transitions. [2019-01-14 15:06:17,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:17,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-14 15:06:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:17,409 INFO L225 Difference]: With dead ends: 353 [2019-01-14 15:06:17,409 INFO L226 Difference]: Without dead ends: 248 [2019-01-14 15:06:17,411 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:06:17,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-14 15:06:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2019-01-14 15:06:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-14 15:06:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 346 transitions. [2019-01-14 15:06:17,433 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 346 transitions. Word has length 39 [2019-01-14 15:06:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:17,433 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 346 transitions. [2019-01-14 15:06:17,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 346 transitions. [2019-01-14 15:06:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 15:06:17,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:17,438 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:06:17,438 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:17,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1173958307, now seen corresponding path program 1 times [2019-01-14 15:06:17,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:17,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:17,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:17,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:17,718 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:06:17,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:17,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:17,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:17,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:17,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:17,721 INFO L87 Difference]: Start difference. First operand 230 states and 346 transitions. Second operand 4 states. [2019-01-14 15:06:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:18,228 INFO L93 Difference]: Finished difference Result 370 states and 557 transitions. [2019-01-14 15:06:18,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:18,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-14 15:06:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:18,234 INFO L225 Difference]: With dead ends: 370 [2019-01-14 15:06:18,234 INFO L226 Difference]: Without dead ends: 247 [2019-01-14 15:06:18,235 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:06:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-14 15:06:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 230. [2019-01-14 15:06:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-14 15:06:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 345 transitions. [2019-01-14 15:06:18,254 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 345 transitions. Word has length 53 [2019-01-14 15:06:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:18,255 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 345 transitions. [2019-01-14 15:06:18,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 345 transitions. [2019-01-14 15:06:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 15:06:18,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:18,259 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:06:18,259 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:18,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash 64977861, now seen corresponding path program 1 times [2019-01-14 15:06:18,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:18,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:18,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:18,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:18,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:18,449 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:06:18,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:18,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:18,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:18,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:18,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:18,451 INFO L87 Difference]: Start difference. First operand 230 states and 345 transitions. Second operand 4 states. [2019-01-14 15:06:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:19,231 INFO L93 Difference]: Finished difference Result 370 states and 555 transitions. [2019-01-14 15:06:19,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:19,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-14 15:06:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:19,234 INFO L225 Difference]: With dead ends: 370 [2019-01-14 15:06:19,234 INFO L226 Difference]: Without dead ends: 247 [2019-01-14 15:06:19,235 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:06:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-14 15:06:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 230. [2019-01-14 15:06:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-14 15:06:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 344 transitions. [2019-01-14 15:06:19,250 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 344 transitions. Word has length 53 [2019-01-14 15:06:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:19,251 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 344 transitions. [2019-01-14 15:06:19,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 344 transitions. [2019-01-14 15:06:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 15:06:19,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:19,255 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:06:19,255 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:19,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:19,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2068706698, now seen corresponding path program 1 times [2019-01-14 15:06:19,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:19,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:19,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:19,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:19,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:19,613 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:06:19,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:19,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:19,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:19,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:19,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:19,618 INFO L87 Difference]: Start difference. First operand 230 states and 344 transitions. Second operand 4 states. [2019-01-14 15:06:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:20,497 INFO L93 Difference]: Finished difference Result 370 states and 553 transitions. [2019-01-14 15:06:20,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:20,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-14 15:06:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:20,500 INFO L225 Difference]: With dead ends: 370 [2019-01-14 15:06:20,500 INFO L226 Difference]: Without dead ends: 247 [2019-01-14 15:06:20,502 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:06:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-14 15:06:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 230. [2019-01-14 15:06:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-14 15:06:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 343 transitions. [2019-01-14 15:06:20,513 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 343 transitions. Word has length 54 [2019-01-14 15:06:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:20,513 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 343 transitions. [2019-01-14 15:06:20,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 343 transitions. [2019-01-14 15:06:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 15:06:20,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:20,518 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:06:20,518 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash -183628160, now seen corresponding path program 1 times [2019-01-14 15:06:20,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:20,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:20,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:20,722 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:06:20,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:20,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:20,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:20,723 INFO L87 Difference]: Start difference. First operand 230 states and 343 transitions. Second operand 4 states. [2019-01-14 15:06:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:21,150 INFO L93 Difference]: Finished difference Result 370 states and 551 transitions. [2019-01-14 15:06:21,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:21,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-14 15:06:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:21,154 INFO L225 Difference]: With dead ends: 370 [2019-01-14 15:06:21,154 INFO L226 Difference]: Without dead ends: 247 [2019-01-14 15:06:21,155 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:06:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-14 15:06:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 230. [2019-01-14 15:06:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-14 15:06:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 342 transitions. [2019-01-14 15:06:21,166 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 342 transitions. Word has length 55 [2019-01-14 15:06:21,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:21,166 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 342 transitions. [2019-01-14 15:06:21,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 342 transitions. [2019-01-14 15:06:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 15:06:21,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:21,169 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:06:21,169 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:21,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:21,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1229951387, now seen corresponding path program 1 times [2019-01-14 15:06:21,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:21,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:21,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:21,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:21,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:21,326 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:06:21,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:21,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:21,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:21,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:21,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:21,328 INFO L87 Difference]: Start difference. First operand 230 states and 342 transitions. Second operand 4 states. [2019-01-14 15:06:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:21,835 INFO L93 Difference]: Finished difference Result 361 states and 538 transitions. [2019-01-14 15:06:21,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:21,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-14 15:06:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:21,838 INFO L225 Difference]: With dead ends: 361 [2019-01-14 15:06:21,838 INFO L226 Difference]: Without dead ends: 238 [2019-01-14 15:06:21,839 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:06:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-01-14 15:06:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2019-01-14 15:06:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-14 15:06:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2019-01-14 15:06:21,846 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 56 [2019-01-14 15:06:21,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:21,846 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2019-01-14 15:06:21,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2019-01-14 15:06:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 15:06:21,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:21,848 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:06:21,848 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1699665034, now seen corresponding path program 1 times [2019-01-14 15:06:21,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:21,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:21,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:21,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:21,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:21,951 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:06:21,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:21,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:06:21,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:06:21,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:06:21,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:06:21,952 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand 3 states. [2019-01-14 15:06:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:22,134 INFO L93 Difference]: Finished difference Result 474 states and 706 transitions. [2019-01-14 15:06:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:06:22,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-14 15:06:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:22,140 INFO L225 Difference]: With dead ends: 474 [2019-01-14 15:06:22,140 INFO L226 Difference]: Without dead ends: 351 [2019-01-14 15:06:22,141 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:06:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-01-14 15:06:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-01-14 15:06:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-14 15:06:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 520 transitions. [2019-01-14 15:06:22,155 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 520 transitions. Word has length 57 [2019-01-14 15:06:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:22,155 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 520 transitions. [2019-01-14 15:06:22,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:06:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 520 transitions. [2019-01-14 15:06:22,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:06:22,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:22,159 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:06:22,159 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:22,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:22,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1132708561, now seen corresponding path program 1 times [2019-01-14 15:06:22,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:22,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:22,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:22,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:22,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:22,366 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:06:22,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:22,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:22,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:22,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:22,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:22,368 INFO L87 Difference]: Start difference. First operand 351 states and 520 transitions. Second operand 4 states. [2019-01-14 15:06:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:23,612 INFO L93 Difference]: Finished difference Result 971 states and 1445 transitions. [2019-01-14 15:06:23,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:23,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 15:06:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:23,619 INFO L225 Difference]: With dead ends: 971 [2019-01-14 15:06:23,619 INFO L226 Difference]: Without dead ends: 627 [2019-01-14 15:06:23,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:06:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-01-14 15:06:23,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 414. [2019-01-14 15:06:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-01-14 15:06:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 625 transitions. [2019-01-14 15:06:23,638 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 625 transitions. Word has length 77 [2019-01-14 15:06:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:23,638 INFO L480 AbstractCegarLoop]: Abstraction has 414 states and 625 transitions. [2019-01-14 15:06:23,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 625 transitions. [2019-01-14 15:06:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:06:23,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:23,642 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:06:23,642 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash -916679281, now seen corresponding path program 1 times [2019-01-14 15:06:23,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:23,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:23,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:23,957 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:06:23,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:23,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:23,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:23,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:23,958 INFO L87 Difference]: Start difference. First operand 414 states and 625 transitions. Second operand 4 states. [2019-01-14 15:06:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:24,689 INFO L93 Difference]: Finished difference Result 963 states and 1452 transitions. [2019-01-14 15:06:24,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:24,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 15:06:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:24,701 INFO L225 Difference]: With dead ends: 963 [2019-01-14 15:06:24,706 INFO L226 Difference]: Without dead ends: 556 [2019-01-14 15:06:24,707 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:06:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-01-14 15:06:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 480. [2019-01-14 15:06:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-14 15:06:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 739 transitions. [2019-01-14 15:06:24,727 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 739 transitions. Word has length 77 [2019-01-14 15:06:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:24,728 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 739 transitions. [2019-01-14 15:06:24,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 739 transitions. [2019-01-14 15:06:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 15:06:24,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:24,733 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:06:24,733 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:24,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:24,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1078757863, now seen corresponding path program 1 times [2019-01-14 15:06:24,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:24,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:24,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:24,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:24,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:25,006 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:06:25,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:25,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:25,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:25,007 INFO L87 Difference]: Start difference. First operand 480 states and 739 transitions. Second operand 4 states. [2019-01-14 15:06:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:25,451 INFO L93 Difference]: Finished difference Result 1026 states and 1560 transitions. [2019-01-14 15:06:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:25,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-14 15:06:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:25,459 INFO L225 Difference]: With dead ends: 1026 [2019-01-14 15:06:25,459 INFO L226 Difference]: Without dead ends: 553 [2019-01-14 15:06:25,462 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:06:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-01-14 15:06:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 480. [2019-01-14 15:06:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-14 15:06:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 736 transitions. [2019-01-14 15:06:25,485 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 736 transitions. Word has length 91 [2019-01-14 15:06:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:25,487 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 736 transitions. [2019-01-14 15:06:25,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 736 transitions. [2019-01-14 15:06:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 15:06:25,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:25,490 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:06:25,490 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:25,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash -30222583, now seen corresponding path program 1 times [2019-01-14 15:06:25,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:25,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:25,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:25,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:25,734 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:06:25,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:25,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:25,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:25,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:25,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:25,737 INFO L87 Difference]: Start difference. First operand 480 states and 736 transitions. Second operand 4 states. [2019-01-14 15:06:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:27,192 INFO L93 Difference]: Finished difference Result 1026 states and 1554 transitions. [2019-01-14 15:06:27,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:27,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-14 15:06:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:27,196 INFO L225 Difference]: With dead ends: 1026 [2019-01-14 15:06:27,196 INFO L226 Difference]: Without dead ends: 553 [2019-01-14 15:06:27,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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:06:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-01-14 15:06:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 480. [2019-01-14 15:06:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-14 15:06:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 733 transitions. [2019-01-14 15:06:27,220 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 733 transitions. Word has length 91 [2019-01-14 15:06:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:27,220 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 733 transitions. [2019-01-14 15:06:27,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 733 transitions. [2019-01-14 15:06:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 15:06:27,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:27,222 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:06:27,224 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:27,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash -882507066, now seen corresponding path program 1 times [2019-01-14 15:06:27,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:27,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:27,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:27,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:27,379 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:06:27,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:27,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:27,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:27,380 INFO L87 Difference]: Start difference. First operand 480 states and 733 transitions. Second operand 4 states. [2019-01-14 15:06:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:27,863 INFO L93 Difference]: Finished difference Result 1026 states and 1548 transitions. [2019-01-14 15:06:27,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:27,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-14 15:06:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:27,867 INFO L225 Difference]: With dead ends: 1026 [2019-01-14 15:06:27,867 INFO L226 Difference]: Without dead ends: 553 [2019-01-14 15:06:27,868 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:06:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-01-14 15:06:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 480. [2019-01-14 15:06:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-14 15:06:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 730 transitions. [2019-01-14 15:06:27,886 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 730 transitions. Word has length 92 [2019-01-14 15:06:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:27,886 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 730 transitions. [2019-01-14 15:06:27,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 730 transitions. [2019-01-14 15:06:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 15:06:27,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:27,888 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:06:27,888 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:27,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1476941628, now seen corresponding path program 1 times [2019-01-14 15:06:27,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:27,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:27,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:27,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:27,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:28,205 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:06:28,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:28,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:28,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:28,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:28,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:28,207 INFO L87 Difference]: Start difference. First operand 480 states and 730 transitions. Second operand 4 states. [2019-01-14 15:06:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:28,653 INFO L93 Difference]: Finished difference Result 1026 states and 1542 transitions. [2019-01-14 15:06:28,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:28,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-14 15:06:28,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:28,659 INFO L225 Difference]: With dead ends: 1026 [2019-01-14 15:06:28,660 INFO L226 Difference]: Without dead ends: 553 [2019-01-14 15:06:28,661 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:06:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-01-14 15:06:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 480. [2019-01-14 15:06:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-14 15:06:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 727 transitions. [2019-01-14 15:06:28,679 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 727 transitions. Word has length 93 [2019-01-14 15:06:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:28,679 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 727 transitions. [2019-01-14 15:06:28,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 727 transitions. [2019-01-14 15:06:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-14 15:06:28,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:28,683 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:06:28,683 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:28,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1627004065, now seen corresponding path program 1 times [2019-01-14 15:06:28,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:28,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:28,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:28,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:28,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:28,997 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:06:28,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:28,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:28,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:28,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:29,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:29,000 INFO L87 Difference]: Start difference. First operand 480 states and 727 transitions. Second operand 4 states. [2019-01-14 15:06:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:29,616 INFO L93 Difference]: Finished difference Result 999 states and 1503 transitions. [2019-01-14 15:06:29,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:29,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-14 15:06:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:29,621 INFO L225 Difference]: With dead ends: 999 [2019-01-14 15:06:29,621 INFO L226 Difference]: Without dead ends: 526 [2019-01-14 15:06:29,623 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:06:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-01-14 15:06:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 480. [2019-01-14 15:06:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-14 15:06:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 724 transitions. [2019-01-14 15:06:29,644 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 724 transitions. Word has length 94 [2019-01-14 15:06:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:29,646 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 724 transitions. [2019-01-14 15:06:29,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 724 transitions. [2019-01-14 15:06:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-14 15:06:29,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:29,649 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:06:29,649 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:29,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash 133010444, now seen corresponding path program 1 times [2019-01-14 15:06:29,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:29,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:29,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:29,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:29,886 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:06:29,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:29,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:29,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:29,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:29,888 INFO L87 Difference]: Start difference. First operand 480 states and 724 transitions. Second operand 4 states. [2019-01-14 15:06:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:30,399 INFO L93 Difference]: Finished difference Result 999 states and 1497 transitions. [2019-01-14 15:06:30,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:30,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-14 15:06:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:30,402 INFO L225 Difference]: With dead ends: 999 [2019-01-14 15:06:30,402 INFO L226 Difference]: Without dead ends: 526 [2019-01-14 15:06:30,404 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:06:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-01-14 15:06:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 480. [2019-01-14 15:06:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-14 15:06:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 721 transitions. [2019-01-14 15:06:30,421 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 721 transitions. Word has length 95 [2019-01-14 15:06:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:30,421 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 721 transitions. [2019-01-14 15:06:30,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 721 transitions. [2019-01-14 15:06:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 15:06:30,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:30,423 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:06:30,423 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2024956777, now seen corresponding path program 1 times [2019-01-14 15:06:30,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:30,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:30,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:30,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:30,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:30,559 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:06:30,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:30,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:06:30,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:06:30,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:06:30,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:06:30,561 INFO L87 Difference]: Start difference. First operand 480 states and 721 transitions. Second operand 4 states. [2019-01-14 15:06:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:31,081 INFO L93 Difference]: Finished difference Result 987 states and 1474 transitions. [2019-01-14 15:06:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:06:31,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-14 15:06:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:31,083 INFO L225 Difference]: With dead ends: 987 [2019-01-14 15:06:31,083 INFO L226 Difference]: Without dead ends: 514 [2019-01-14 15:06:31,084 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:06:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-01-14 15:06:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 480. [2019-01-14 15:06:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-01-14 15:06:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 718 transitions. [2019-01-14 15:06:31,101 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 718 transitions. Word has length 96 [2019-01-14 15:06:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:31,101 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 718 transitions. [2019-01-14 15:06:31,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:06:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 718 transitions. [2019-01-14 15:06:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:06:31,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:31,103 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:06:31,103 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:31,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:31,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1514969424, now seen corresponding path program 1 times [2019-01-14 15:06:31,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:31,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:31,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:31,275 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:06:31,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:31,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:06:31,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:06:31,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:06:31,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:06:31,277 INFO L87 Difference]: Start difference. First operand 480 states and 718 transitions. Second operand 6 states. [2019-01-14 15:06:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:32,154 INFO L93 Difference]: Finished difference Result 894 states and 1335 transitions. [2019-01-14 15:06:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:06:32,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-01-14 15:06:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:32,160 INFO L225 Difference]: With dead ends: 894 [2019-01-14 15:06:32,161 INFO L226 Difference]: Without dead ends: 562 [2019-01-14 15:06:32,162 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:06:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-01-14 15:06:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 488. [2019-01-14 15:06:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-01-14 15:06:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 731 transitions. [2019-01-14 15:06:32,187 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 731 transitions. Word has length 98 [2019-01-14 15:06:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:32,188 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 731 transitions. [2019-01-14 15:06:32,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:06:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 731 transitions. [2019-01-14 15:06:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 15:06:32,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:32,191 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:06:32,192 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:32,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1169008539, now seen corresponding path program 1 times [2019-01-14 15:06:32,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:32,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:32,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:32,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:32,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:32,462 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 15:06:32,661 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:06:32,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:32,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:06:32,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:06:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:06:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:06:32,663 INFO L87 Difference]: Start difference. First operand 488 states and 731 transitions. Second operand 6 states. [2019-01-14 15:06:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:33,563 INFO L93 Difference]: Finished difference Result 891 states and 1331 transitions. [2019-01-14 15:06:33,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:06:33,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-01-14 15:06:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:33,569 INFO L225 Difference]: With dead ends: 891 [2019-01-14 15:06:33,569 INFO L226 Difference]: Without dead ends: 559 [2019-01-14 15:06:33,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:06:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-01-14 15:06:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 489. [2019-01-14 15:06:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-01-14 15:06:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 732 transitions. [2019-01-14 15:06:33,589 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 732 transitions. Word has length 99 [2019-01-14 15:06:33,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:33,589 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 732 transitions. [2019-01-14 15:06:33,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:06:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 732 transitions. [2019-01-14 15:06:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 15:06:33,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:33,591 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:06:33,592 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:33,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:33,592 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2019-01-14 15:06:33,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:06:33,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:06:33,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:33,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:33,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:06:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:06:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:06:34,185 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:06:34,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:06:34 BoogieIcfgContainer [2019-01-14 15:06:34,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:06:34,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:06:34,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:06:34,337 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:06:34,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:06:15" (3/4) ... [2019-01-14 15:06:34,342 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 15:06:34,342 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:06:34,343 INFO L168 Benchmark]: Toolchain (without parser) took 22456.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:06:34,344 INFO L168 Benchmark]: CDTParser took 0.45 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:06:34,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 912.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:06:34,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:06:34,347 INFO L168 Benchmark]: Boogie Preprocessor took 147.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:06:34,348 INFO L168 Benchmark]: RCFGBuilder took 2029.05 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: 85.6 MB). Peak memory consumption was 85.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:06:34,349 INFO L168 Benchmark]: TraceAbstraction took 19196.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -92.9 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:06:34,350 INFO L168 Benchmark]: Witness Printer took 5.87 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:06:34,358 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.45 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 912.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 156.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 147.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2029.05 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: 85.6 MB). Peak memory consumption was 85.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19196.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -92.9 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.87 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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}] [L1303] COND FALSE !(ret <= 0) [L1308] s->state = 4384 [L1309] s->init_num = 0 [L1310] EXPR s->bbio [L1310] EXPR s->wbio VAL [init=1, SSLv3_client_data={-4:0}] [L1310] 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 [L1318] ret = __VERIFIER_nondet_int() [L1319] COND TRUE blastFlag == 1 [L1320] 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: 3621 SDtfs, 1434 SDslu, 5137 SDs, 0 SdLazy, 2811 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 18 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=489occurred 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, 945 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1506 NumberOfCodeBlocks, 1506 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1375 ConstructedInterpolants, 0 QuantifiedInterpolants, 257889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 1218/1218 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:06:36,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:06:36,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:06:36,718 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:06:36,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:06:36,720 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:06:36,721 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:06:36,723 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:06:36,725 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:06:36,726 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:06:36,727 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:06:36,727 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:06:36,728 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:06:36,729 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:06:36,730 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:06:36,731 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:06:36,732 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:06:36,734 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:06:36,736 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:06:36,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:06:36,739 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:06:36,741 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:06:36,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:06:36,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:06:36,744 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:06:36,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:06:36,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:06:36,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:06:36,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:06:36,749 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:06:36,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:06:36,750 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:06:36,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:06:36,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:06:36,755 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:06:36,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:06:36,756 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:06:36,784 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:06:36,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:06:36,786 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:06:36,786 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:06:36,787 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:06:36,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:06:36,788 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:06:36,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:06:36,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:06:36,788 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:06:36,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:06:36,789 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:06:36,789 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 15:06:36,789 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 15:06:36,789 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:06:36,789 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:06:36,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:06:36,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:06:36,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:06:36,791 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:06:36,792 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:06:36,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:06:36,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:06:36,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:06:36,793 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:06:36,793 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 15:06:36,793 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:06:36,793 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 15:06:36,793 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-14 15:06:36,793 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 -> 69033ce18a9d55d3b643fc421e26bf1667e81629 [2019-01-14 15:06:36,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:06:36,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:06:36,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:06:36,881 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:06:36,881 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:06:36,882 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c [2019-01-14 15:06:36,950 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/251a605f6/3ec9af88d36e4082b1639cfe0ddde799/FLAG25e3ed11d [2019-01-14 15:06:37,533 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:06:37,534 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c [2019-01-14 15:06:37,555 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/251a605f6/3ec9af88d36e4082b1639cfe0ddde799/FLAG25e3ed11d [2019-01-14 15:06:37,768 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/251a605f6/3ec9af88d36e4082b1639cfe0ddde799 [2019-01-14 15:06:37,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:06:37,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:06:37,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:06:37,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:06:37,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:06:37,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:06:37" (1/1) ... [2019-01-14 15:06:37,780 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:06:37, skipping insertion in model container [2019-01-14 15:06:37,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:06:37" (1/1) ... [2019-01-14 15:06:37,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:06:37,860 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:06:38,422 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:06:38,580 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:06:38,766 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:06:38,803 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:06:38,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:38 WrapperNode [2019-01-14 15:06:38,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:06:38,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:06:38,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:06:38,804 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:06:38,813 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:06:38" (1/1) ... [2019-01-14 15:06:38,872 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:06:38" (1/1) ... [2019-01-14 15:06:38,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:06:38,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:06:38,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:06:38,959 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:06:38,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:38" (1/1) ... [2019-01-14 15:06:38,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:38" (1/1) ... [2019-01-14 15:06:38,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:38" (1/1) ... [2019-01-14 15:06:38,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:38" (1/1) ... [2019-01-14 15:06:39,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:38" (1/1) ... [2019-01-14 15:06:39,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:38" (1/1) ... [2019-01-14 15:06:39,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:38" (1/1) ... [2019-01-14 15:06:39,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:06:39,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:06:39,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:06:39,126 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:06:39,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:38" (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:06:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:06:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-01-14 15:06:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:06:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:06:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-14 15:06:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:06:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:06:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:06:39,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:06:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-14 15:06:39,597 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:06:44,495 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 15:06:44,496 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 15:06:44,497 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:06:44,497 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:06:44,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:06:44 BoogieIcfgContainer [2019-01-14 15:06:44,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:06:44,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:06:44,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:06:44,506 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:06:44,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:06:37" (1/3) ... [2019-01-14 15:06:44,507 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:06:44, skipping insertion in model container [2019-01-14 15:06:44,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:38" (2/3) ... [2019-01-14 15:06:44,508 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:06:44, skipping insertion in model container [2019-01-14 15:06:44,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:06:44" (3/3) ... [2019-01-14 15:06:44,510 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02_false-unreach-call.i.cil.c [2019-01-14 15:06:44,519 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:06:44,526 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:06:44,542 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:06:44,574 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:06:44,575 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:06:44,575 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:06:44,575 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:06:44,575 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:06:44,575 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:06:44,575 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:06:44,576 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:06:44,576 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:06:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-01-14 15:06:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 15:06:44,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:44,604 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:06:44,607 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:44,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:44,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-01-14 15:06:44,618 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:06:44,619 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:06:44,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:44,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:06:44,929 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:06:44,930 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:06:44,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:44,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:06:44,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:06:44,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:06:44,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:06:44,968 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2019-01-14 15:06:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:45,200 INFO L93 Difference]: Finished difference Result 368 states and 621 transitions. [2019-01-14 15:06:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:06:45,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 15:06:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:45,222 INFO L225 Difference]: With dead ends: 368 [2019-01-14 15:06:45,222 INFO L226 Difference]: Without dead ends: 212 [2019-01-14 15:06:45,227 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:06:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-14 15:06:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-01-14 15:06:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-14 15:06:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 316 transitions. [2019-01-14 15:06:45,290 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 316 transitions. Word has length 24 [2019-01-14 15:06:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:45,291 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 316 transitions. [2019-01-14 15:06:45,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:06:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 316 transitions. [2019-01-14 15:06:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 15:06:45,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:45,295 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:06:45,295 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1509035189, now seen corresponding path program 1 times [2019-01-14 15:06:45,297 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:06:45,297 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:06:45,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:45,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:06:45,571 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:06:45,571 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:06:45,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:45,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:06:45,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:06:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:06:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:06:45,582 INFO L87 Difference]: Start difference. First operand 212 states and 316 transitions. Second operand 3 states. [2019-01-14 15:06:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:47,327 INFO L93 Difference]: Finished difference Result 417 states and 627 transitions. [2019-01-14 15:06:47,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:06:47,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-14 15:06:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:47,332 INFO L225 Difference]: With dead ends: 417 [2019-01-14 15:06:47,332 INFO L226 Difference]: Without dead ends: 312 [2019-01-14 15:06:47,334 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:06:47,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-14 15:06:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-01-14 15:06:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-14 15:06:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 463 transitions. [2019-01-14 15:06:47,363 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 463 transitions. Word has length 39 [2019-01-14 15:06:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:47,363 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 463 transitions. [2019-01-14 15:06:47,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:06:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 463 transitions. [2019-01-14 15:06:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 15:06:47,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:47,369 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:06:47,369 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1699665034, now seen corresponding path program 1 times [2019-01-14 15:06:47,371 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:06:47,371 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:06:47,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:47,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:06:47,656 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:06:47,657 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2019-01-14 15:06:47,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:47,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:06:47,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:06:47,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:06:47,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:06:47,665 INFO L87 Difference]: Start difference. First operand 312 states and 463 transitions. Second operand 3 states. [2019-01-14 15:06:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:49,809 INFO L93 Difference]: Finished difference Result 619 states and 924 transitions. [2019-01-14 15:06:49,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:06:49,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-14 15:06:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:49,813 INFO L225 Difference]: With dead ends: 619 [2019-01-14 15:06:49,813 INFO L226 Difference]: Without dead ends: 414 [2019-01-14 15:06:49,815 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:06:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-14 15:06:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2019-01-14 15:06:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-01-14 15:06:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2019-01-14 15:06:49,841 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2019-01-14 15:06:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:49,842 INFO L480 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2019-01-14 15:06:49,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:06:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2019-01-14 15:06:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:06:49,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:49,848 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:06:49,848 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:49,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1132708561, now seen corresponding path program 1 times [2019-01-14 15:06:49,850 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:06:49,851 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:06:49,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:50,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:06:50,090 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:06:50,092 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:06:50,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:50,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:06:50,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:06:50,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:06:50,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:06:50,097 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand 3 states. [2019-01-14 15:06:52,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:06:52,301 INFO L93 Difference]: Finished difference Result 822 states and 1223 transitions. [2019-01-14 15:06:52,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:06:52,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-01-14 15:06:52,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:06:52,306 INFO L225 Difference]: With dead ends: 822 [2019-01-14 15:06:52,306 INFO L226 Difference]: Without dead ends: 515 [2019-01-14 15:06:52,308 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:06:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-01-14 15:06:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-01-14 15:06:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-01-14 15:06:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2019-01-14 15:06:52,332 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2019-01-14 15:06:52,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:06:52,333 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2019-01-14 15:06:52,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:06:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2019-01-14 15:06:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:06:52,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:06:52,339 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:06:52,339 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:06:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:06:52,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1093818034, now seen corresponding path program 1 times [2019-01-14 15:06:52,341 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:06:52,341 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:06:52,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:06:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:06:53,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:06:53,913 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 15:06:54,035 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-14 15:06:54,041 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:06:54,050 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:06:54,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,087 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:06:54,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,147 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:06:54,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,276 INFO L303 Elim1Store]: Index analysis took 124 ms [2019-01-14 15:06:54,278 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:06:54,279 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:06:54,338 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:06:54,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:06:54,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:06:54,427 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:06:54,447 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:06:54,448 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:06:54,607 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:06:54,630 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:06:54,650 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:06:54,664 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:06:54,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,701 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:06:54,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,762 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:06:54,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:54,842 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:06:54,844 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 15:06:54,928 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:06:54,971 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:06:55,010 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:06:55,067 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:06:55,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:55,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:55,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:55,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:55,559 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:06:55,563 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2019-01-14 15:06:55,871 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:06:55,964 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:06:56,132 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:06:56,133 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:61, output treesize:80 [2019-01-14 15:06:56,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:56,272 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:06:56,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:56,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:56,292 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:06:56,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:06:56,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:06:56,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:56,465 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:06:56,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:56,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:56,597 INFO L303 Elim1Store]: Index analysis took 126 ms [2019-01-14 15:06:56,598 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:06:56,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:06:56,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:56,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:56,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:56,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:06:56,842 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:06:56,845 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2019-01-14 15:06:56,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:06:57,067 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:06:57,067 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:92 [2019-01-14 15:06:57,366 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 15:06:57,473 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:06:57,482 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:06:57,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:06:57,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:06:57,486 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:06:57,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 15:06:57,527 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:06:57,528 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:06:57,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:06:57,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 15:06:57,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:06:57,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:06:57,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:06:57,539 INFO L87 Difference]: Start difference. First operand 515 states and 762 transitions. Second operand 7 states. [2019-01-14 15:07:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:14,884 INFO L93 Difference]: Finished difference Result 1007 states and 1489 transitions. [2019-01-14 15:07:14,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:07:14,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-01-14 15:07:14,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:14,891 INFO L225 Difference]: With dead ends: 1007 [2019-01-14 15:07:14,891 INFO L226 Difference]: Without dead ends: 597 [2019-01-14 15:07:14,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 92 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:07:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-01-14 15:07:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 523. [2019-01-14 15:07:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-01-14 15:07:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 775 transitions. [2019-01-14 15:07:14,918 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 775 transitions. Word has length 98 [2019-01-14 15:07:14,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:14,919 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 775 transitions. [2019-01-14 15:07:14,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:07:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 775 transitions. [2019-01-14 15:07:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 15:07:14,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:14,923 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:07:14,923 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:14,923 INFO L82 PathProgramCache]: Analyzing trace with hash 517171299, now seen corresponding path program 1 times [2019-01-14 15:07:14,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:07:14,924 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:07:14,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:16,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:07:16,294 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 15:07:16,348 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:07:16,358 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:07:16,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,386 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:07:16,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,430 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:07:16,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,476 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:07:16,477 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:07:16,502 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:16,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:16,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:16,643 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:07:16,648 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:07:16,649 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:07:16,669 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:16,692 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:07:16,713 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:07:16,722 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:07:16,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,745 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:07:16,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,798 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:07:16,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:16,895 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:07:16,896 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 15:07:16,935 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:16,966 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:17,000 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:17,047 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:07:17,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:17,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:17,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:17,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:17,185 INFO L303 Elim1Store]: Index analysis took 135 ms [2019-01-14 15:07:17,278 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:07:17,280 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2019-01-14 15:07:17,411 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:07:17,675 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:07:17,828 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:07:17,829 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:61, output treesize:102 [2019-01-14 15:07:18,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:18,039 INFO L303 Elim1Store]: Index analysis took 129 ms [2019-01-14 15:07:18,233 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:07:18,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:18,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:18,256 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:07:18,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:07:18,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:18,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:18,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:18,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:18,461 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:07:18,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 15:07:18,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:07:18,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:18,751 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:07:18,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:18,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:18,768 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:07:18,768 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:07:18,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:18,902 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:07:18,903 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:92 [2019-01-14 15:07:19,075 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 15:07:19,237 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 15:07:19,288 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:07:19,299 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:07:19,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:07:19,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:19,305 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:07:19,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 15:07:19,350 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:07:19,351 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:07:19,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:19,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 15:07:19,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:07:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:07:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:07:19,358 INFO L87 Difference]: Start difference. First operand 523 states and 775 transitions. Second operand 7 states. [2019-01-14 15:07:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:33,591 INFO L93 Difference]: Finished difference Result 1004 states and 1485 transitions. [2019-01-14 15:07:33,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:07:33,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-01-14 15:07:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:33,599 INFO L225 Difference]: With dead ends: 1004 [2019-01-14 15:07:33,599 INFO L226 Difference]: Without dead ends: 594 [2019-01-14 15:07:33,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:07:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-01-14 15:07:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 524. [2019-01-14 15:07:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-01-14 15:07:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 776 transitions. [2019-01-14 15:07:33,620 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 776 transitions. Word has length 99 [2019-01-14 15:07:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:33,621 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 776 transitions. [2019-01-14 15:07:33,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:07:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 776 transitions. [2019-01-14 15:07:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 15:07:33,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:33,625 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:07:33,626 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:33,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:33,626 INFO L82 PathProgramCache]: Analyzing trace with hash 924378278, now seen corresponding path program 1 times [2019-01-14 15:07:33,627 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:07:33,627 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:07:33,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:07:34,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:07:34,669 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:07:34,677 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:07:34,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:07:34,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:34,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:34,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-01-14 15:07:34,709 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:07:34,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:34,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:34,715 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:07:34,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:07:34,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:34,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:34,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-01-14 15:07:34,853 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:07:34,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:07:34,858 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:07:34,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:07:34,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:07:34,866 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:07:34,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-01-14 15:07:34,888 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:07:34,888 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:07:34,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:07:34,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:07:34,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:07:34,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:07:34,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:07:34,894 INFO L87 Difference]: Start difference. First operand 524 states and 776 transitions. Second operand 6 states. [2019-01-14 15:07:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:07:44,264 INFO L93 Difference]: Finished difference Result 1403 states and 2079 transitions. [2019-01-14 15:07:44,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:07:44,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-01-14 15:07:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:07:44,275 INFO L225 Difference]: With dead ends: 1403 [2019-01-14 15:07:44,275 INFO L226 Difference]: Without dead ends: 895 [2019-01-14 15:07:44,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:07:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-01-14 15:07:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 608. [2019-01-14 15:07:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-01-14 15:07:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 916 transitions. [2019-01-14 15:07:44,311 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 916 transitions. Word has length 112 [2019-01-14 15:07:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:07:44,315 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 916 transitions. [2019-01-14 15:07:44,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:07:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 916 transitions. [2019-01-14 15:07:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 15:07:44,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:07:44,318 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:07:44,319 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:07:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:07:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2019-01-14 15:07:44,321 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:07:44,321 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:07:44,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:07:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:07:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:07:53,326 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:07:53,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:07:53 BoogieIcfgContainer [2019-01-14 15:07:53,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:07:53,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:07:53,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:07:53,486 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:07:53,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:06:44" (3/4) ... [2019-01-14 15:07:53,490 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:07:53,656 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:07:53,656 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:07:53,657 INFO L168 Benchmark]: Toolchain (without parser) took 75885.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -87.5 MB). Peak memory consumption was 222.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:07:53,658 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:07:53,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1030.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:07:53,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.78 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:07:53,659 INFO L168 Benchmark]: Boogie Preprocessor took 166.44 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:07:53,661 INFO L168 Benchmark]: RCFGBuilder took 5374.45 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: 91.0 MB). Peak memory consumption was 91.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:07:53,661 INFO L168 Benchmark]: TraceAbstraction took 68984.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -36.6 MB). Peak memory consumption was 131.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:07:53,661 INFO L168 Benchmark]: Witness Printer took 171.16 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:07:53,664 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1030.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 153.78 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 166.44 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5374.45 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: 91.0 MB). Peak memory consumption was 91.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68984.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -36.6 MB). Peak memory consumption was 131.1 MB. Max. memory is 11.5 GB. * Witness Printer took 171.16 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 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}] [L1303] COND FALSE !(ret <= 0) [L1308] s->state = 4384 [L1309] s->init_num = 0 [L1310] EXPR s->bbio [L1310] EXPR s->wbio VAL [init=1, SSLv3_client_data={280:0}] [L1310] 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 [L1318] ret = __VERIFIER_nondet_int() [L1319] COND TRUE blastFlag == 1 [L1320] 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, 68.9s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 47.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1524 SDtfs, 1190 SDslu, 1696 SDs, 0 SdLazy, 1285 SolverSat, 63 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 45.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 431 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 7.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 618 NumberOfCodeBlocks, 618 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 499 ConstructedInterpolants, 12 QuantifiedInterpolants, 209535 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1743 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 487/487 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...