./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b059dfef9f85366fcaeddec812cf96c32b1df0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b059dfef9f85366fcaeddec812cf96c32b1df0d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-20 04:01:13,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:01:13,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:01:13,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:01:13,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:01:13,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:01:13,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:01:13,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:01:13,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:01:13,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:01:13,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:01:13,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:01:13,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:01:13,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:01:13,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:01:13,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:01:13,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:01:13,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:01:13,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:01:13,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:01:13,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:01:13,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:01:13,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:01:13,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:01:13,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:01:13,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:01:13,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:01:13,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:01:13,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:01:13,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:01:13,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:01:13,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:01:13,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:01:13,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:01:13,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:01:13,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:01:13,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:01:13,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:01:13,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:01:13,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:01:13,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:01:13,246 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 04:01:13,275 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:01:13,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:01:13,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:01:13,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:01:13,288 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:01:13,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:01:13,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:01:13,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:01:13,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:01:13,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:01:13,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:01:13,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:01:13,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:01:13,290 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:01:13,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:01:13,291 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:01:13,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:01:13,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:01:13,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:01:13,292 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:01:13,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:01:13,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:01:13,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:01:13,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:01:13,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:01:13,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:01:13,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:01:13,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:01:13,295 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b059dfef9f85366fcaeddec812cf96c32b1df0d [2019-11-20 04:01:13,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:01:13,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:01:13,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:01:13,496 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:01:13,497 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:01:13,497 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-20 04:01:13,573 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/data/67d4b1383/d619970b698943a58a46dcca23e37de4/FLAG3441dc107 [2019-11-20 04:01:14,079 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:01:14,080 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-20 04:01:14,096 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/data/67d4b1383/d619970b698943a58a46dcca23e37de4/FLAG3441dc107 [2019-11-20 04:01:14,288 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/data/67d4b1383/d619970b698943a58a46dcca23e37de4 [2019-11-20 04:01:14,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:01:14,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:01:14,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:01:14,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:01:14,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:01:14,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:14,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b503d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14, skipping insertion in model container [2019-11-20 04:01:14,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:14,305 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:01:14,371 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:01:14,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:01:14,854 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:01:14,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:01:14,973 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:01:14,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14 WrapperNode [2019-11-20 04:01:14,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:01:14,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:01:14,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:01:14,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:01:14,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:15,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:15,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:01:15,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:01:15,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:01:15,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:01:15,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:15,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:15,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:15,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:15,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:15,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:15,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (1/1) ... [2019-11-20 04:01:15,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:01:15,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:01:15,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:01:15,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:01:15,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:01:15,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 04:01:15,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:01:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 04:01:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 04:01:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 04:01:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 04:01:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:01:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:01:15,546 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 04:01:16,558 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 04:01:16,558 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 04:01:16,560 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:01:16,560 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 04:01:16,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:01:16 BoogieIcfgContainer [2019-11-20 04:01:16,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:01:16,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:01:16,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:01:16,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:01:16,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:01:14" (1/3) ... [2019-11-20 04:01:16,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b8d6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:01:16, skipping insertion in model container [2019-11-20 04:01:16,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:14" (2/3) ... [2019-11-20 04:01:16,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b8d6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:01:16, skipping insertion in model container [2019-11-20 04:01:16,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:01:16" (3/3) ... [2019-11-20 04:01:16,567 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2019-11-20 04:01:16,575 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:01:16,581 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:01:16,591 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:01:16,621 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:01:16,623 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:01:16,623 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:01:16,623 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:01:16,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:01:16,624 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:01:16,624 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:01:16,624 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:01:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-20 04:01:16,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 04:01:16,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:16,668 INFO L410 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-11-20 04:01:16,669 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:16,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:16,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-11-20 04:01:16,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:16,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612094612] [2019-11-20 04:01:16,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:01:16,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612094612] [2019-11-20 04:01:16,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:16,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:16,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273109346] [2019-11-20 04:01:17,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:17,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:17,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:17,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:17,015 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2019-11-20 04:01:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:17,391 INFO L93 Difference]: Finished difference Result 259 states and 432 transitions. [2019-11-20 04:01:17,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:17,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 04:01:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:17,405 INFO L225 Difference]: With dead ends: 259 [2019-11-20 04:01:17,405 INFO L226 Difference]: Without dead ends: 118 [2019-11-20 04:01:17,409 INFO L630 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-11-20 04:01:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-20 04:01:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-11-20 04:01:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-20 04:01:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2019-11-20 04:01:17,452 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 24 [2019-11-20 04:01:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:17,453 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2019-11-20 04:01:17,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2019-11-20 04:01:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 04:01:17,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:17,455 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 04:01:17,455 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1411658380, now seen corresponding path program 1 times [2019-11-20 04:01:17,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:17,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546332820] [2019-11-20 04:01:17,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:01:17,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546332820] [2019-11-20 04:01:17,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:17,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:01:17,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598814196] [2019-11-20 04:01:17,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:01:17,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:01:17,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:01:17,642 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand 3 states. [2019-11-20 04:01:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:17,711 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2019-11-20 04:01:17,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:01:17,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 04:01:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:17,715 INFO L225 Difference]: With dead ends: 327 [2019-11-20 04:01:17,715 INFO L226 Difference]: Without dead ends: 220 [2019-11-20 04:01:17,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:01:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-20 04:01:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-20 04:01:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-20 04:01:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 324 transitions. [2019-11-20 04:01:17,746 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 324 transitions. Word has length 39 [2019-11-20 04:01:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:17,747 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 324 transitions. [2019-11-20 04:01:17,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:01:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 324 transitions. [2019-11-20 04:01:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 04:01:17,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:17,750 INFO L410 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, 1] [2019-11-20 04:01:17,750 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1352249408, now seen corresponding path program 1 times [2019-11-20 04:01:17,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:17,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236458816] [2019-11-20 04:01:17,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:01:17,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236458816] [2019-11-20 04:01:17,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:17,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:01:17,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840506978] [2019-11-20 04:01:17,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:01:17,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:17,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:01:17,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:01:17,845 INFO L87 Difference]: Start difference. First operand 220 states and 324 transitions. Second operand 3 states. [2019-11-20 04:01:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:17,949 INFO L93 Difference]: Finished difference Result 429 states and 639 transitions. [2019-11-20 04:01:17,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:01:17,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-20 04:01:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:17,954 INFO L225 Difference]: With dead ends: 429 [2019-11-20 04:01:17,954 INFO L226 Difference]: Without dead ends: 322 [2019-11-20 04:01:17,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:01:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-20 04:01:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-11-20 04:01:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-20 04:01:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2019-11-20 04:01:17,999 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 54 [2019-11-20 04:01:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:18,000 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2019-11-20 04:01:18,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:01:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2019-11-20 04:01:18,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 04:01:18,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:18,004 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:18,004 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:18,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:18,005 INFO L82 PathProgramCache]: Analyzing trace with hash 210697016, now seen corresponding path program 1 times [2019-11-20 04:01:18,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:18,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732729487] [2019-11-20 04:01:18,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:18,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732729487] [2019-11-20 04:01:18,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:18,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:18,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752985809] [2019-11-20 04:01:18,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:18,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:18,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:18,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:18,202 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand 4 states. [2019-11-20 04:01:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:18,874 INFO L93 Difference]: Finished difference Result 822 states and 1213 transitions. [2019-11-20 04:01:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:18,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-20 04:01:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:18,882 INFO L225 Difference]: With dead ends: 822 [2019-11-20 04:01:18,882 INFO L226 Difference]: Without dead ends: 510 [2019-11-20 04:01:18,886 INFO L630 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-11-20 04:01:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-20 04:01:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 372. [2019-11-20 04:01:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-20 04:01:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2019-11-20 04:01:18,917 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 72 [2019-11-20 04:01:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:18,918 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2019-11-20 04:01:18,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2019-11-20 04:01:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 04:01:18,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:18,926 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:18,926 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash 76683510, now seen corresponding path program 1 times [2019-11-20 04:01:18,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:18,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420020698] [2019-11-20 04:01:18,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:19,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420020698] [2019-11-20 04:01:19,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:19,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:19,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946391482] [2019-11-20 04:01:19,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:19,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:19,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:19,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:19,071 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand 4 states. [2019-11-20 04:01:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:19,561 INFO L93 Difference]: Finished difference Result 818 states and 1229 transitions. [2019-11-20 04:01:19,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:19,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-20 04:01:19,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:19,566 INFO L225 Difference]: With dead ends: 818 [2019-11-20 04:01:19,566 INFO L226 Difference]: Without dead ends: 456 [2019-11-20 04:01:19,567 INFO L630 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-11-20 04:01:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-20 04:01:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 412. [2019-11-20 04:01:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-20 04:01:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2019-11-20 04:01:19,585 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 72 [2019-11-20 04:01:19,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:19,585 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2019-11-20 04:01:19,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2019-11-20 04:01:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 04:01:19,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:19,587 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:19,588 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:19,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:19,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2062745025, now seen corresponding path program 1 times [2019-11-20 04:01:19,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:19,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612370123] [2019-11-20 04:01:19,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:19,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612370123] [2019-11-20 04:01:19,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:19,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:19,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043145311] [2019-11-20 04:01:19,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:19,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:19,689 INFO L87 Difference]: Start difference. First operand 412 states and 627 transitions. Second operand 4 states. [2019-11-20 04:01:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:20,272 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2019-11-20 04:01:20,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:20,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 04:01:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:20,278 INFO L225 Difference]: With dead ends: 946 [2019-11-20 04:01:20,278 INFO L226 Difference]: Without dead ends: 544 [2019-11-20 04:01:20,279 INFO L630 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-11-20 04:01:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-20 04:01:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 414. [2019-11-20 04:01:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-20 04:01:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2019-11-20 04:01:20,299 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 73 [2019-11-20 04:01:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:20,305 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2019-11-20 04:01:20,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2019-11-20 04:01:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 04:01:20,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:20,307 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:20,308 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:20,308 INFO L82 PathProgramCache]: Analyzing trace with hash 475156595, now seen corresponding path program 1 times [2019-11-20 04:01:20,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:20,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910605861] [2019-11-20 04:01:20,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:20,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910605861] [2019-11-20 04:01:20,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:20,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:20,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141652231] [2019-11-20 04:01:20,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:20,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:20,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:20,399 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. Second operand 4 states. [2019-11-20 04:01:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:20,953 INFO L93 Difference]: Finished difference Result 948 states and 1426 transitions. [2019-11-20 04:01:20,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:20,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 04:01:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:20,961 INFO L225 Difference]: With dead ends: 948 [2019-11-20 04:01:20,962 INFO L226 Difference]: Without dead ends: 544 [2019-11-20 04:01:20,963 INFO L630 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-11-20 04:01:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-20 04:01:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 416. [2019-11-20 04:01:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-20 04:01:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2019-11-20 04:01:20,981 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 74 [2019-11-20 04:01:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:20,981 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2019-11-20 04:01:20,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2019-11-20 04:01:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 04:01:20,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:20,983 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:20,983 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1840475418, now seen corresponding path program 1 times [2019-11-20 04:01:20,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:20,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874651870] [2019-11-20 04:01:20,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:21,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874651870] [2019-11-20 04:01:21,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:21,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:21,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965214647] [2019-11-20 04:01:21,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:21,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:21,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:21,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:21,083 INFO L87 Difference]: Start difference. First operand 416 states and 631 transitions. Second operand 4 states. [2019-11-20 04:01:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:21,631 INFO L93 Difference]: Finished difference Result 940 states and 1414 transitions. [2019-11-20 04:01:21,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:21,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 04:01:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:21,635 INFO L225 Difference]: With dead ends: 940 [2019-11-20 04:01:21,635 INFO L226 Difference]: Without dead ends: 534 [2019-11-20 04:01:21,636 INFO L630 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-11-20 04:01:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-20 04:01:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 418. [2019-11-20 04:01:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2019-11-20 04:01:21,650 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 75 [2019-11-20 04:01:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:21,651 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2019-11-20 04:01:21,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2019-11-20 04:01:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:01:21,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:21,653 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:21,653 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:21,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1935805867, now seen corresponding path program 2 times [2019-11-20 04:01:21,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:21,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595801291] [2019-11-20 04:01:21,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:21,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595801291] [2019-11-20 04:01:21,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:21,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:21,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716873017] [2019-11-20 04:01:21,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:21,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:21,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:21,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:21,732 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand 4 states. [2019-11-20 04:01:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:22,265 INFO L93 Difference]: Finished difference Result 940 states and 1412 transitions. [2019-11-20 04:01:22,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:22,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 04:01:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:22,269 INFO L225 Difference]: With dead ends: 940 [2019-11-20 04:01:22,269 INFO L226 Difference]: Without dead ends: 532 [2019-11-20 04:01:22,270 INFO L630 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-11-20 04:01:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-20 04:01:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-20 04:01:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 631 transitions. [2019-11-20 04:01:22,286 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 631 transitions. Word has length 87 [2019-11-20 04:01:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:22,286 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 631 transitions. [2019-11-20 04:01:22,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 631 transitions. [2019-11-20 04:01:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:01:22,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:22,289 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:22,289 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:22,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1954461325, now seen corresponding path program 1 times [2019-11-20 04:01:22,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:22,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451863176] [2019-11-20 04:01:22,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:22,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451863176] [2019-11-20 04:01:22,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:22,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:22,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378951411] [2019-11-20 04:01:22,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:22,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:22,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:22,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:22,399 INFO L87 Difference]: Start difference. First operand 418 states and 631 transitions. Second operand 4 states. [2019-11-20 04:01:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:22,874 INFO L93 Difference]: Finished difference Result 940 states and 1408 transitions. [2019-11-20 04:01:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:22,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 04:01:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:22,880 INFO L225 Difference]: With dead ends: 940 [2019-11-20 04:01:22,880 INFO L226 Difference]: Without dead ends: 532 [2019-11-20 04:01:22,881 INFO L630 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-11-20 04:01:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-20 04:01:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-20 04:01:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 629 transitions. [2019-11-20 04:01:22,925 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 629 transitions. Word has length 87 [2019-11-20 04:01:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:22,925 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 629 transitions. [2019-11-20 04:01:22,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 629 transitions. [2019-11-20 04:01:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:01:22,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:22,927 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:22,927 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:22,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:22,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1635005334, now seen corresponding path program 1 times [2019-11-20 04:01:22,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:22,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943381480] [2019-11-20 04:01:22,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:22,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943381480] [2019-11-20 04:01:22,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:22,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:22,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966793988] [2019-11-20 04:01:22,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:22,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:22,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:22,997 INFO L87 Difference]: Start difference. First operand 418 states and 629 transitions. Second operand 4 states. [2019-11-20 04:01:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:23,498 INFO L93 Difference]: Finished difference Result 791 states and 1178 transitions. [2019-11-20 04:01:23,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:23,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 04:01:23,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:23,502 INFO L225 Difference]: With dead ends: 791 [2019-11-20 04:01:23,502 INFO L226 Difference]: Without dead ends: 532 [2019-11-20 04:01:23,503 INFO L630 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-11-20 04:01:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-20 04:01:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-20 04:01:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 627 transitions. [2019-11-20 04:01:23,516 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 627 transitions. Word has length 87 [2019-11-20 04:01:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:23,516 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 627 transitions. [2019-11-20 04:01:23,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 627 transitions. [2019-11-20 04:01:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:01:23,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:23,518 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:23,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash 513794263, now seen corresponding path program 2 times [2019-11-20 04:01:23,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:23,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782330807] [2019-11-20 04:01:23,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:23,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782330807] [2019-11-20 04:01:23,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:23,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:23,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282956911] [2019-11-20 04:01:23,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:23,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:23,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:23,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:23,589 INFO L87 Difference]: Start difference. First operand 418 states and 627 transitions. Second operand 4 states. [2019-11-20 04:01:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:23,986 INFO L93 Difference]: Finished difference Result 868 states and 1293 transitions. [2019-11-20 04:01:23,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:23,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 04:01:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:23,990 INFO L225 Difference]: With dead ends: 868 [2019-11-20 04:01:23,990 INFO L226 Difference]: Without dead ends: 460 [2019-11-20 04:01:23,991 INFO L630 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-11-20 04:01:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-20 04:01:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-20 04:01:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 625 transitions. [2019-11-20 04:01:24,006 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 625 transitions. Word has length 87 [2019-11-20 04:01:24,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:24,006 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 625 transitions. [2019-11-20 04:01:24,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 625 transitions. [2019-11-20 04:01:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:01:24,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:24,009 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:24,009 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:24,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:24,010 INFO L82 PathProgramCache]: Analyzing trace with hash 495138805, now seen corresponding path program 1 times [2019-11-20 04:01:24,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:24,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807102117] [2019-11-20 04:01:24,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:24,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807102117] [2019-11-20 04:01:24,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:24,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:24,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399875985] [2019-11-20 04:01:24,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:24,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:24,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:24,081 INFO L87 Difference]: Start difference. First operand 418 states and 625 transitions. Second operand 4 states. [2019-11-20 04:01:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:24,472 INFO L93 Difference]: Finished difference Result 868 states and 1289 transitions. [2019-11-20 04:01:24,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:24,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 04:01:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:24,475 INFO L225 Difference]: With dead ends: 868 [2019-11-20 04:01:24,475 INFO L226 Difference]: Without dead ends: 460 [2019-11-20 04:01:24,476 INFO L630 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-11-20 04:01:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-20 04:01:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-20 04:01:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 623 transitions. [2019-11-20 04:01:24,489 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 623 transitions. Word has length 87 [2019-11-20 04:01:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:24,489 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 623 transitions. [2019-11-20 04:01:24,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 623 transitions. [2019-11-20 04:01:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:01:24,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:24,491 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:24,492 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:24,493 INFO L82 PathProgramCache]: Analyzing trace with hash -210361832, now seen corresponding path program 1 times [2019-11-20 04:01:24,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:24,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158960572] [2019-11-20 04:01:24,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:24,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158960572] [2019-11-20 04:01:24,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:24,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:24,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574637150] [2019-11-20 04:01:24,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:24,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:24,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:24,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:24,568 INFO L87 Difference]: Start difference. First operand 418 states and 623 transitions. Second operand 4 states. [2019-11-20 04:01:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:24,944 INFO L93 Difference]: Finished difference Result 719 states and 1062 transitions. [2019-11-20 04:01:24,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:24,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 04:01:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:24,946 INFO L225 Difference]: With dead ends: 719 [2019-11-20 04:01:24,947 INFO L226 Difference]: Without dead ends: 460 [2019-11-20 04:01:24,947 INFO L630 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-11-20 04:01:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-20 04:01:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-20 04:01:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 621 transitions. [2019-11-20 04:01:24,959 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 621 transitions. Word has length 87 [2019-11-20 04:01:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:24,959 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 621 transitions. [2019-11-20 04:01:24,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 621 transitions. [2019-11-20 04:01:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 04:01:24,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:24,961 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:24,961 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:24,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1668397004, now seen corresponding path program 1 times [2019-11-20 04:01:24,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:24,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298708198] [2019-11-20 04:01:24,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:25,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298708198] [2019-11-20 04:01:25,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:25,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:25,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959744744] [2019-11-20 04:01:25,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:25,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:25,026 INFO L87 Difference]: Start difference. First operand 418 states and 621 transitions. Second operand 4 states. [2019-11-20 04:01:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:25,578 INFO L93 Difference]: Finished difference Result 940 states and 1388 transitions. [2019-11-20 04:01:25,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:25,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 04:01:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:25,581 INFO L225 Difference]: With dead ends: 940 [2019-11-20 04:01:25,582 INFO L226 Difference]: Without dead ends: 532 [2019-11-20 04:01:25,583 INFO L630 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-11-20 04:01:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-20 04:01:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-20 04:01:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2019-11-20 04:01:25,595 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 88 [2019-11-20 04:01:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:25,595 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2019-11-20 04:01:25,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2019-11-20 04:01:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 04:01:25,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:25,597 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:25,597 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:25,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:25,597 INFO L82 PathProgramCache]: Analyzing trace with hash -570561745, now seen corresponding path program 1 times [2019-11-20 04:01:25,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:25,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192892270] [2019-11-20 04:01:25,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:25,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192892270] [2019-11-20 04:01:25,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:25,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:25,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010391796] [2019-11-20 04:01:25,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:25,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:25,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:25,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:25,672 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand 4 states. [2019-11-20 04:01:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:26,107 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2019-11-20 04:01:26,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:26,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 04:01:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:26,111 INFO L225 Difference]: With dead ends: 785 [2019-11-20 04:01:26,111 INFO L226 Difference]: Without dead ends: 526 [2019-11-20 04:01:26,112 INFO L630 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-11-20 04:01:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-20 04:01:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2019-11-20 04:01:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 617 transitions. [2019-11-20 04:01:26,124 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 617 transitions. Word has length 88 [2019-11-20 04:01:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:26,124 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 617 transitions. [2019-11-20 04:01:26,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 617 transitions. [2019-11-20 04:01:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 04:01:26,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:26,126 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:26,126 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:26,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash 296589706, now seen corresponding path program 1 times [2019-11-20 04:01:26,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:26,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49828834] [2019-11-20 04:01:26,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:26,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49828834] [2019-11-20 04:01:26,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:26,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:26,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898567517] [2019-11-20 04:01:26,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:26,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:26,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:26,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:26,213 INFO L87 Difference]: Start difference. First operand 418 states and 617 transitions. Second operand 4 states. [2019-11-20 04:01:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:26,505 INFO L93 Difference]: Finished difference Result 868 states and 1273 transitions. [2019-11-20 04:01:26,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:26,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 04:01:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:26,510 INFO L225 Difference]: With dead ends: 868 [2019-11-20 04:01:26,510 INFO L226 Difference]: Without dead ends: 460 [2019-11-20 04:01:26,510 INFO L630 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-11-20 04:01:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-20 04:01:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-20 04:01:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 615 transitions. [2019-11-20 04:01:26,524 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 615 transitions. Word has length 88 [2019-11-20 04:01:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:26,524 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 615 transitions. [2019-11-20 04:01:26,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 615 transitions. [2019-11-20 04:01:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 04:01:26,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:26,527 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:26,527 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1942369043, now seen corresponding path program 1 times [2019-11-20 04:01:26,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:26,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002113714] [2019-11-20 04:01:26,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:26,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002113714] [2019-11-20 04:01:26,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:26,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:26,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500168449] [2019-11-20 04:01:26,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:26,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:26,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:26,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:26,625 INFO L87 Difference]: Start difference. First operand 418 states and 615 transitions. Second operand 4 states. [2019-11-20 04:01:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:26,987 INFO L93 Difference]: Finished difference Result 713 states and 1043 transitions. [2019-11-20 04:01:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:26,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 04:01:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:26,991 INFO L225 Difference]: With dead ends: 713 [2019-11-20 04:01:26,991 INFO L226 Difference]: Without dead ends: 454 [2019-11-20 04:01:26,991 INFO L630 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-11-20 04:01:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-20 04:01:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2019-11-20 04:01:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 613 transitions. [2019-11-20 04:01:27,002 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 613 transitions. Word has length 88 [2019-11-20 04:01:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:27,002 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 613 transitions. [2019-11-20 04:01:27,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 613 transitions. [2019-11-20 04:01:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 04:01:27,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:27,004 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:27,004 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:27,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:27,005 INFO L82 PathProgramCache]: Analyzing trace with hash -233112104, now seen corresponding path program 1 times [2019-11-20 04:01:27,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:27,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054985318] [2019-11-20 04:01:27,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:27,058 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:27,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054985318] [2019-11-20 04:01:27,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:27,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:27,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445366961] [2019-11-20 04:01:27,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:27,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:27,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:27,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:27,062 INFO L87 Difference]: Start difference. First operand 418 states and 613 transitions. Second operand 4 states. [2019-11-20 04:01:27,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:27,540 INFO L93 Difference]: Finished difference Result 934 states and 1365 transitions. [2019-11-20 04:01:27,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:27,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 04:01:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:27,543 INFO L225 Difference]: With dead ends: 934 [2019-11-20 04:01:27,543 INFO L226 Difference]: Without dead ends: 526 [2019-11-20 04:01:27,544 INFO L630 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-11-20 04:01:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-20 04:01:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2019-11-20 04:01:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2019-11-20 04:01:27,558 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 89 [2019-11-20 04:01:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:27,558 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2019-11-20 04:01:27,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2019-11-20 04:01:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 04:01:27,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:27,560 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:27,560 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 190534618, now seen corresponding path program 1 times [2019-11-20 04:01:27,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:27,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348389413] [2019-11-20 04:01:27,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:27,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348389413] [2019-11-20 04:01:27,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:27,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:27,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846991191] [2019-11-20 04:01:27,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:27,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:27,627 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 4 states. [2019-11-20 04:01:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:28,029 INFO L93 Difference]: Finished difference Result 862 states and 1254 transitions. [2019-11-20 04:01:28,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:28,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 04:01:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:28,032 INFO L225 Difference]: With dead ends: 862 [2019-11-20 04:01:28,032 INFO L226 Difference]: Without dead ends: 454 [2019-11-20 04:01:28,033 INFO L630 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-11-20 04:01:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-20 04:01:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2019-11-20 04:01:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 609 transitions. [2019-11-20 04:01:28,043 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 609 transitions. Word has length 89 [2019-11-20 04:01:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:28,044 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 609 transitions. [2019-11-20 04:01:28,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 609 transitions. [2019-11-20 04:01:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 04:01:28,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:28,046 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:28,046 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:28,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:28,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1591319919, now seen corresponding path program 1 times [2019-11-20 04:01:28,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:28,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389380109] [2019-11-20 04:01:28,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:28,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389380109] [2019-11-20 04:01:28,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:28,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:28,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917354379] [2019-11-20 04:01:28,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:28,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:28,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:28,115 INFO L87 Difference]: Start difference. First operand 418 states and 609 transitions. Second operand 4 states. [2019-11-20 04:01:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:28,610 INFO L93 Difference]: Finished difference Result 916 states and 1335 transitions. [2019-11-20 04:01:28,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:28,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 04:01:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:28,614 INFO L225 Difference]: With dead ends: 916 [2019-11-20 04:01:28,614 INFO L226 Difference]: Without dead ends: 508 [2019-11-20 04:01:28,617 INFO L630 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-11-20 04:01:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-20 04:01:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2019-11-20 04:01:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 607 transitions. [2019-11-20 04:01:28,628 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 607 transitions. Word has length 90 [2019-11-20 04:01:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:28,628 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 607 transitions. [2019-11-20 04:01:28,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 607 transitions. [2019-11-20 04:01:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 04:01:28,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:28,630 INFO L410 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] [2019-11-20 04:01:28,630 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1012220386, now seen corresponding path program 1 times [2019-11-20 04:01:28,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:28,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534137153] [2019-11-20 04:01:28,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:28,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534137153] [2019-11-20 04:01:28,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:28,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:28,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373176148] [2019-11-20 04:01:28,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:28,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:28,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:28,711 INFO L87 Difference]: Start difference. First operand 418 states and 607 transitions. Second operand 4 states. [2019-11-20 04:01:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:29,201 INFO L93 Difference]: Finished difference Result 916 states and 1331 transitions. [2019-11-20 04:01:29,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:29,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 04:01:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:29,205 INFO L225 Difference]: With dead ends: 916 [2019-11-20 04:01:29,205 INFO L226 Difference]: Without dead ends: 508 [2019-11-20 04:01:29,206 INFO L630 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-11-20 04:01:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-20 04:01:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2019-11-20 04:01:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2019-11-20 04:01:29,217 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 90 [2019-11-20 04:01:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:29,217 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2019-11-20 04:01:29,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2019-11-20 04:01:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 04:01:29,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:29,219 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:29,220 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1343173425, now seen corresponding path program 1 times [2019-11-20 04:01:29,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:29,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683219679] [2019-11-20 04:01:29,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:01:29,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683219679] [2019-11-20 04:01:29,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:29,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:29,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532098484] [2019-11-20 04:01:29,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:29,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:29,292 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand 4 states. [2019-11-20 04:01:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:29,632 INFO L93 Difference]: Finished difference Result 844 states and 1220 transitions. [2019-11-20 04:01:29,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:29,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 04:01:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:29,635 INFO L225 Difference]: With dead ends: 844 [2019-11-20 04:01:29,635 INFO L226 Difference]: Without dead ends: 436 [2019-11-20 04:01:29,636 INFO L630 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-11-20 04:01:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-20 04:01:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 418. [2019-11-20 04:01:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 04:01:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 603 transitions. [2019-11-20 04:01:29,646 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 603 transitions. Word has length 90 [2019-11-20 04:01:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:29,647 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 603 transitions. [2019-11-20 04:01:29,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 603 transitions. [2019-11-20 04:01:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 04:01:29,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:29,649 INFO L410 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] [2019-11-20 04:01:29,649 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:29,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1260366880, now seen corresponding path program 1 times [2019-11-20 04:01:29,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:29,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964311184] [2019-11-20 04:01:29,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 04:01:29,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964311184] [2019-11-20 04:01:29,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:29,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:01:29,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103066948] [2019-11-20 04:01:29,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:01:29,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:29,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:01:29,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:01:29,713 INFO L87 Difference]: Start difference. First operand 418 states and 603 transitions. Second operand 3 states. [2019-11-20 04:01:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:29,753 INFO L93 Difference]: Finished difference Result 828 states and 1201 transitions. [2019-11-20 04:01:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:01:29,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-20 04:01:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:29,756 INFO L225 Difference]: With dead ends: 828 [2019-11-20 04:01:29,756 INFO L226 Difference]: Without dead ends: 571 [2019-11-20 04:01:29,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:01:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-20 04:01:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-20 04:01:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-20 04:01:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 824 transitions. [2019-11-20 04:01:29,772 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 824 transitions. Word has length 90 [2019-11-20 04:01:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:29,772 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 824 transitions. [2019-11-20 04:01:29,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:01:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 824 transitions. [2019-11-20 04:01:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 04:01:29,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:29,774 INFO L410 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, 1] [2019-11-20 04:01:29,774 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:29,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:29,775 INFO L82 PathProgramCache]: Analyzing trace with hash -584407498, now seen corresponding path program 1 times [2019-11-20 04:01:29,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:29,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420213004] [2019-11-20 04:01:29,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 04:01:29,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420213004] [2019-11-20 04:01:29,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:29,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:01:29,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093587720] [2019-11-20 04:01:29,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:01:29,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:29,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:01:29,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:01:29,833 INFO L87 Difference]: Start difference. First operand 571 states and 824 transitions. Second operand 3 states. [2019-11-20 04:01:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:29,881 INFO L93 Difference]: Finished difference Result 726 states and 1049 transitions. [2019-11-20 04:01:29,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:01:29,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-20 04:01:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:29,885 INFO L225 Difference]: With dead ends: 726 [2019-11-20 04:01:29,885 INFO L226 Difference]: Without dead ends: 724 [2019-11-20 04:01:29,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:01:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-20 04:01:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-11-20 04:01:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-11-20 04:01:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1046 transitions. [2019-11-20 04:01:29,902 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1046 transitions. Word has length 92 [2019-11-20 04:01:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:29,902 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1046 transitions. [2019-11-20 04:01:29,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:01:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1046 transitions. [2019-11-20 04:01:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 04:01:29,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:29,905 INFO L410 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, 1] [2019-11-20 04:01:29,905 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:29,906 INFO L82 PathProgramCache]: Analyzing trace with hash -782701753, now seen corresponding path program 1 times [2019-11-20 04:01:29,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:29,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651567786] [2019-11-20 04:01:29,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:01:30,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651567786] [2019-11-20 04:01:30,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:30,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:01:30,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477134798] [2019-11-20 04:01:30,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:01:30,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:01:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:01:30,006 INFO L87 Difference]: Start difference. First operand 724 states and 1046 transitions. Second operand 3 states. [2019-11-20 04:01:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:30,036 INFO L93 Difference]: Finished difference Result 726 states and 1047 transitions. [2019-11-20 04:01:30,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:01:30,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-20 04:01:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:30,040 INFO L225 Difference]: With dead ends: 726 [2019-11-20 04:01:30,041 INFO L226 Difference]: Without dead ends: 724 [2019-11-20 04:01:30,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:01:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-20 04:01:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-11-20 04:01:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-11-20 04:01:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1045 transitions. [2019-11-20 04:01:30,058 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1045 transitions. Word has length 113 [2019-11-20 04:01:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:30,059 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1045 transitions. [2019-11-20 04:01:30,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:01:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1045 transitions. [2019-11-20 04:01:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 04:01:30,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:30,062 INFO L410 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, 1, 1, 1] [2019-11-20 04:01:30,062 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:30,063 INFO L82 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2019-11-20 04:01:30,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:30,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490210771] [2019-11-20 04:01:30,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:01:30,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490210771] [2019-11-20 04:01:30,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:30,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:30,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396992682] [2019-11-20 04:01:30,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:30,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:30,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:30,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:30,167 INFO L87 Difference]: Start difference. First operand 724 states and 1045 transitions. Second operand 4 states. [2019-11-20 04:01:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:30,566 INFO L93 Difference]: Finished difference Result 1695 states and 2458 transitions. [2019-11-20 04:01:30,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:30,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-20 04:01:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:30,572 INFO L225 Difference]: With dead ends: 1695 [2019-11-20 04:01:30,572 INFO L226 Difference]: Without dead ends: 981 [2019-11-20 04:01:30,573 INFO L630 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-11-20 04:01:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-11-20 04:01:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2019-11-20 04:01:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-20 04:01:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1255 transitions. [2019-11-20 04:01:30,595 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1255 transitions. Word has length 115 [2019-11-20 04:01:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:30,595 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1255 transitions. [2019-11-20 04:01:30,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1255 transitions. [2019-11-20 04:01:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 04:01:30,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:30,598 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:30,599 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:30,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:30,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 2 times [2019-11-20 04:01:30,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:30,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44626033] [2019-11-20 04:01:30,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:01:30,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44626033] [2019-11-20 04:01:30,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:30,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:30,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730859711] [2019-11-20 04:01:30,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:30,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:30,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:30,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:30,677 INFO L87 Difference]: Start difference. First operand 844 states and 1255 transitions. Second operand 4 states. [2019-11-20 04:01:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:31,092 INFO L93 Difference]: Finished difference Result 1810 states and 2658 transitions. [2019-11-20 04:01:31,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:31,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-20 04:01:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:31,098 INFO L225 Difference]: With dead ends: 1810 [2019-11-20 04:01:31,098 INFO L226 Difference]: Without dead ends: 976 [2019-11-20 04:01:31,100 INFO L630 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-11-20 04:01:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-11-20 04:01:31,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-11-20 04:01:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-20 04:01:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1250 transitions. [2019-11-20 04:01:31,122 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1250 transitions. Word has length 130 [2019-11-20 04:01:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:31,122 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1250 transitions. [2019-11-20 04:01:31,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1250 transitions. [2019-11-20 04:01:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 04:01:31,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:31,125 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:31,125 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:31,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:31,126 INFO L82 PathProgramCache]: Analyzing trace with hash 919227327, now seen corresponding path program 1 times [2019-11-20 04:01:31,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:31,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071778116] [2019-11-20 04:01:31,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:01:31,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071778116] [2019-11-20 04:01:31,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:31,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:31,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371104910] [2019-11-20 04:01:31,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:31,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:31,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:31,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:31,203 INFO L87 Difference]: Start difference. First operand 844 states and 1250 transitions. Second operand 4 states. [2019-11-20 04:01:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:31,594 INFO L93 Difference]: Finished difference Result 1810 states and 2648 transitions. [2019-11-20 04:01:31,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:31,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-20 04:01:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:31,600 INFO L225 Difference]: With dead ends: 1810 [2019-11-20 04:01:31,600 INFO L226 Difference]: Without dead ends: 976 [2019-11-20 04:01:31,602 INFO L630 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-11-20 04:01:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-11-20 04:01:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-11-20 04:01:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-20 04:01:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1245 transitions. [2019-11-20 04:01:31,623 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1245 transitions. Word has length 130 [2019-11-20 04:01:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:31,624 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1245 transitions. [2019-11-20 04:01:31,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1245 transitions. [2019-11-20 04:01:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 04:01:31,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:31,627 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:31,627 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:31,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:31,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947938, now seen corresponding path program 1 times [2019-11-20 04:01:31,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:31,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031321627] [2019-11-20 04:01:31,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 04:01:31,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031321627] [2019-11-20 04:01:31,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:31,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:31,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386641929] [2019-11-20 04:01:31,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:31,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:31,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:31,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:31,702 INFO L87 Difference]: Start difference. First operand 844 states and 1245 transitions. Second operand 4 states. [2019-11-20 04:01:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:32,025 INFO L93 Difference]: Finished difference Result 1641 states and 2428 transitions. [2019-11-20 04:01:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:32,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-20 04:01:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:32,030 INFO L225 Difference]: With dead ends: 1641 [2019-11-20 04:01:32,031 INFO L226 Difference]: Without dead ends: 982 [2019-11-20 04:01:32,032 INFO L630 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-11-20 04:01:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-11-20 04:01:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2019-11-20 04:01:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-20 04:01:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1365 transitions. [2019-11-20 04:01:32,054 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1365 transitions. Word has length 130 [2019-11-20 04:01:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:32,054 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1365 transitions. [2019-11-20 04:01:32,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1365 transitions. [2019-11-20 04:01:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 04:01:32,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:32,057 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:32,058 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:32,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1834884522, now seen corresponding path program 1 times [2019-11-20 04:01:32,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:32,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480448653] [2019-11-20 04:01:32,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:01:32,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480448653] [2019-11-20 04:01:32,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:32,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:32,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967674657] [2019-11-20 04:01:32,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:32,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:32,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:32,132 INFO L87 Difference]: Start difference. First operand 916 states and 1365 transitions. Second operand 4 states. [2019-11-20 04:01:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:32,545 INFO L93 Difference]: Finished difference Result 1954 states and 2878 transitions. [2019-11-20 04:01:32,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:32,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-20 04:01:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:32,551 INFO L225 Difference]: With dead ends: 1954 [2019-11-20 04:01:32,551 INFO L226 Difference]: Without dead ends: 1048 [2019-11-20 04:01:32,552 INFO L630 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-11-20 04:01:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-11-20 04:01:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-11-20 04:01:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-20 04:01:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1360 transitions. [2019-11-20 04:01:32,574 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1360 transitions. Word has length 131 [2019-11-20 04:01:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:32,574 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1360 transitions. [2019-11-20 04:01:32,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1360 transitions. [2019-11-20 04:01:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 04:01:32,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:32,578 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:32,578 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:32,579 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2019-11-20 04:01:32,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:32,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462719702] [2019-11-20 04:01:32,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:01:32,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462719702] [2019-11-20 04:01:32,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:32,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:32,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136642988] [2019-11-20 04:01:32,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:32,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:32,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:32,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:32,671 INFO L87 Difference]: Start difference. First operand 916 states and 1360 transitions. Second operand 4 states. [2019-11-20 04:01:33,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:33,075 INFO L93 Difference]: Finished difference Result 1954 states and 2868 transitions. [2019-11-20 04:01:33,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:33,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-20 04:01:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:33,080 INFO L225 Difference]: With dead ends: 1954 [2019-11-20 04:01:33,080 INFO L226 Difference]: Without dead ends: 1048 [2019-11-20 04:01:33,081 INFO L630 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-11-20 04:01:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-11-20 04:01:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-11-20 04:01:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-20 04:01:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1355 transitions. [2019-11-20 04:01:33,108 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1355 transitions. Word has length 132 [2019-11-20 04:01:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:33,108 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1355 transitions. [2019-11-20 04:01:33,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1355 transitions. [2019-11-20 04:01:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-20 04:01:33,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:33,112 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:33,112 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2019-11-20 04:01:33,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:33,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973939633] [2019-11-20 04:01:33,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:01:33,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973939633] [2019-11-20 04:01:33,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:33,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:33,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373004385] [2019-11-20 04:01:33,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:33,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:33,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:33,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:33,238 INFO L87 Difference]: Start difference. First operand 916 states and 1355 transitions. Second operand 4 states. [2019-11-20 04:01:33,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:33,518 INFO L93 Difference]: Finished difference Result 1909 states and 2803 transitions. [2019-11-20 04:01:33,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:33,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-20 04:01:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:33,524 INFO L225 Difference]: With dead ends: 1909 [2019-11-20 04:01:33,524 INFO L226 Difference]: Without dead ends: 1003 [2019-11-20 04:01:33,526 INFO L630 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-11-20 04:01:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-11-20 04:01:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2019-11-20 04:01:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-20 04:01:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1350 transitions. [2019-11-20 04:01:33,549 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1350 transitions. Word has length 133 [2019-11-20 04:01:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:33,550 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1350 transitions. [2019-11-20 04:01:33,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1350 transitions. [2019-11-20 04:01:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-20 04:01:33,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:33,552 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:01:33,553 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:33,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:33,553 INFO L82 PathProgramCache]: Analyzing trace with hash 487188268, now seen corresponding path program 1 times [2019-11-20 04:01:33,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:33,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615047513] [2019-11-20 04:01:33,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-20 04:01:33,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615047513] [2019-11-20 04:01:33,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:33,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:01:33,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113087283] [2019-11-20 04:01:33,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:33,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:01:33,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:33,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:33,626 INFO L87 Difference]: Start difference. First operand 916 states and 1350 transitions. Second operand 4 states. [2019-11-20 04:01:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:33,985 INFO L93 Difference]: Finished difference Result 2054 states and 3033 transitions. [2019-11-20 04:01:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:33,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-20 04:01:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:33,992 INFO L225 Difference]: With dead ends: 2054 [2019-11-20 04:01:33,992 INFO L226 Difference]: Without dead ends: 1148 [2019-11-20 04:01:33,994 INFO L630 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-11-20 04:01:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-20 04:01:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2019-11-20 04:01:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-11-20 04:01:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1540 transitions. [2019-11-20 04:01:34,017 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1540 transitions. Word has length 133 [2019-11-20 04:01:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:34,018 INFO L462 AbstractCegarLoop]: Abstraction has 1026 states and 1540 transitions. [2019-11-20 04:01:34,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1540 transitions. [2019-11-20 04:01:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 04:01:34,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:34,021 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2019-11-20 04:01:34,021 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:34,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:34,021 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-11-20 04:01:34,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:01:34,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292121030] [2019-11-20 04:01:34,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:01:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:01:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:01:34,542 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:01:34,543 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 04:01:34,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:01:34 BoogieIcfgContainer [2019-11-20 04:01:34,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:01:34,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:01:34,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:01:34,721 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:01:34,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:01:16" (3/4) ... [2019-11-20 04:01:34,724 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 04:01:34,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:01:34,726 INFO L168 Benchmark]: Toolchain (without parser) took 20434.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 233.1 MB. Max. memory is 11.5 GB. [2019-11-20 04:01:34,726 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:01:34,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:01:34,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:01:34,727 INFO L168 Benchmark]: Boogie Preprocessor took 102.73 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 04:01:34,728 INFO L168 Benchmark]: RCFGBuilder took 1385.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.7 MB in the end (delta: 90.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. [2019-11-20 04:01:34,728 INFO L168 Benchmark]: TraceAbstraction took 18158.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 263.7 MB). Free memory was 998.7 MB in the beginning and 1.1 GB in the end (delta: -98.6 MB). Peak memory consumption was 165.1 MB. Max. memory is 11.5 GB. [2019-11-20 04:01:34,728 INFO L168 Benchmark]: Witness Printer took 3.91 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-11-20 04:01:34,730 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 682.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.73 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1385.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.7 MB in the end (delta: 90.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18158.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 263.7 MB). Free memory was 998.7 MB in the beginning and 1.1 GB in the end (delta: -98.6 MB). Peak memory consumption was 165.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.91 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: 1644]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1329. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={9: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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [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___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [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] EXPR s->info_callback VAL [init=1, SSLv3_client_data={9:0}] [L1109] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1110] EXPR s->info_callback [L1110] cb = s->info_callback [L1118] EXPR s->in_handshake [L1118] s->in_handshake += 1 [L1119] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND TRUE s->state == 12292 [L1235] s->new_session = 1 [L1236] s->state = 4096 [L1237] EXPR s->ctx [L1237] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1237] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1242] s->server = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1243] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={9:0}] [L1248] EXPR s->version VAL [init=1, SSLv3_client_data={9:0}] [L1248] COND FALSE !((s->version & 65280) != 768) [L1254] s->type = 4096 [L1255] EXPR s->init_buf VAL [init=1, SSLv3_client_data={9:0}] [L1255] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1267] tmp___4 = __VERIFIER_nondet_int() [L1268] COND FALSE !(! tmp___4) [L1274] tmp___5 = __VERIFIER_nondet_int() [L1275] COND FALSE !(! tmp___5) [L1281] s->state = 4368 [L1282] EXPR s->ctx [L1282] EXPR (s->ctx)->stats.sess_connect [L1282] (s->ctx)->stats.sess_connect += 1 [L1283] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND TRUE s->state == 4368 [L1287] s->shutdown = 0 [L1288] ret = __VERIFIER_nondet_int() [L1289] COND TRUE blastFlag == 0 [L1290] blastFlag = 1 VAL [init=1, SSLv3_client_data={9:0}] [L1294] COND FALSE !(ret <= 0) [L1299] s->state = 4384 [L1300] s->init_num = 0 [L1301] EXPR s->bbio [L1301] EXPR s->wbio VAL [init=1, SSLv3_client_data={9:0}] [L1301] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND TRUE s->state == 4384 [L1309] ret = __VERIFIER_nondet_int() [L1310] COND TRUE blastFlag == 1 [L1311] blastFlag = 2 VAL [init=1, SSLv3_client_data={9:0}] [L1315] COND FALSE !(ret <= 0) [L1320] s->hit VAL [init=1, SSLv3_client_data={9:0}] [L1320] COND FALSE !(s->hit) [L1323] s->state = 4400 VAL [init=1, SSLv3_client_data={9:0}] [L1325] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND TRUE s->state == 4400 [L1329] EXPR s->s3 [L1329] EXPR (s->s3)->tmp.new_cipher [L1329] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={9:0}] [L1329] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1332] ret = __VERIFIER_nondet_int() [L1333] COND TRUE blastFlag == 2 [L1334] blastFlag = 3 VAL [init=1, SSLv3_client_data={9:0}] [L1338] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={9:0}] [L1344] s->state = 4416 [L1345] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1165] COND TRUE s->state == 4416 [L1349] ret = __VERIFIER_nondet_int() [L1350] COND TRUE blastFlag == 3 [L1351] blastFlag = 4 VAL [init=1, SSLv3_client_data={9:0}] [L1355] COND FALSE !(ret <= 0) [L1360] s->state = 4432 [L1361] s->init_num = 0 [L1362] tmp___6 = __VERIFIER_nondet_int() [L1363] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1171] COND TRUE s->state == 4432 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={9:0}] [L1378] COND FALSE !(ret <= 0) [L1383] s->state = 4448 [L1384] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1171] COND FALSE !(s->state == 4432) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1174] COND FALSE !(s->state == 4433) [L1177] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1177] COND TRUE s->state == 4448 [L1388] ret = __VERIFIER_nondet_int() [L1389] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={9:0}] [L1644] __VERIFIER_error() VAL [init=1, SSLv3_client_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Result: UNSAFE, OverallTime: 18.0s, OverallIterations: 35, TraceHistogramMax: 7, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7208 SDtfs, 2447 SDslu, 9311 SDs, 0 SdLazy, 5221 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 68 SyntacticMatches, 21 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1026occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3271 NumberOfCodeBlocks, 3271 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3100 ConstructedInterpolants, 0 QuantifiedInterpolants, 675721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 3328/3328 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 04:01:36,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:01:36,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:01:36,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:01:36,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:01:36,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:01:36,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:01:36,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:01:36,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:01:36,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:01:36,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:01:36,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:01:36,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:01:36,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:01:36,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:01:36,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:01:36,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:01:36,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:01:36,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:01:36,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:01:36,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:01:36,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:01:36,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:01:36,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:01:36,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:01:36,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:01:36,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:01:36,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:01:36,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:01:36,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:01:36,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:01:36,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:01:36,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:01:36,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:01:36,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:01:36,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:01:36,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:01:36,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:01:36,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:01:36,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:01:36,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:01:36,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 04:01:36,694 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:01:36,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:01:36,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:01:36,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:01:36,705 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:01:36,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:01:36,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:01:36,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:01:36,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:01:36,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:01:36,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:01:36,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:01:36,707 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 04:01:36,707 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 04:01:36,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:01:36,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:01:36,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:01:36,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:01:36,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:01:36,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:01:36,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:01:36,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:01:36,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:01:36,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:01:36,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:01:36,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:01:36,711 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 04:01:36,711 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 04:01:36,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:01:36,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 04:01:36,712 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b059dfef9f85366fcaeddec812cf96c32b1df0d [2019-11-20 04:01:37,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:01:37,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:01:37,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:01:37,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:01:37,049 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:01:37,051 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-20 04:01:37,112 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/data/81422acc7/863e76bb6c204d38ac08b494d4b37fae/FLAG4a40246eb [2019-11-20 04:01:37,606 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:01:37,607 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-20 04:01:37,629 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/data/81422acc7/863e76bb6c204d38ac08b494d4b37fae/FLAG4a40246eb [2019-11-20 04:01:37,865 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/data/81422acc7/863e76bb6c204d38ac08b494d4b37fae [2019-11-20 04:01:37,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:01:37,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:01:37,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:01:37,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:01:37,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:01:37,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:01:37" (1/1) ... [2019-11-20 04:01:37,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d84af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:37, skipping insertion in model container [2019-11-20 04:01:37,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:01:37" (1/1) ... [2019-11-20 04:01:37,883 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:01:37,969 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:01:38,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:01:38,523 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:01:38,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:01:38,727 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:01:38,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38 WrapperNode [2019-11-20 04:01:38,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:01:38,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:01:38,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:01:38,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:01:38,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (1/1) ... [2019-11-20 04:01:38,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (1/1) ... [2019-11-20 04:01:38,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:01:38,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:01:38,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:01:38,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:01:38,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (1/1) ... [2019-11-20 04:01:38,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (1/1) ... [2019-11-20 04:01:38,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (1/1) ... [2019-11-20 04:01:38,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (1/1) ... [2019-11-20 04:01:38,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (1/1) ... [2019-11-20 04:01:38,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (1/1) ... [2019-11-20 04:01:38,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (1/1) ... [2019-11-20 04:01:38,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:01:38,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:01:38,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:01:38,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:01:38,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:01:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 04:01:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:01:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 04:01:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 04:01:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 04:01:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:01:38,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:01:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 04:01:39,159 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 04:01:42,187 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 04:01:42,188 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 04:01:42,189 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:01:42,189 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 04:01:42,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:01:42 BoogieIcfgContainer [2019-11-20 04:01:42,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:01:42,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:01:42,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:01:42,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:01:42,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:01:37" (1/3) ... [2019-11-20 04:01:42,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bb64c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:01:42, skipping insertion in model container [2019-11-20 04:01:42,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:01:38" (2/3) ... [2019-11-20 04:01:42,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bb64c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:01:42, skipping insertion in model container [2019-11-20 04:01:42,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:01:42" (3/3) ... [2019-11-20 04:01:42,199 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2019-11-20 04:01:42,208 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:01:42,214 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:01:42,221 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:01:42,242 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:01:42,243 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:01:42,243 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:01:42,243 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:01:42,243 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:01:42,243 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:01:42,243 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:01:42,244 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:01:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-20 04:01:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 04:01:42,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:42,268 INFO L410 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-11-20 04:01:42,268 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-11-20 04:01:42,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:01:42,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1331942150] [2019-11-20 04:01:42,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/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-11-20 04:01:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:42,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:01:42,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:01:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:01:42,517 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:01:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:01:42,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1331942150] [2019-11-20 04:01:42,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:42,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 04:01:42,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037840935] [2019-11-20 04:01:42,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:42,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:01:42,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:42,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:42,558 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2019-11-20 04:01:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:42,677 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2019-11-20 04:01:42,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:42,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 04:01:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:42,711 INFO L225 Difference]: With dead ends: 375 [2019-11-20 04:01:42,712 INFO L226 Difference]: Without dead ends: 217 [2019-11-20 04:01:42,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-20 04:01:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-11-20 04:01:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-20 04:01:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2019-11-20 04:01:42,778 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 24 [2019-11-20 04:01:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:42,778 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2019-11-20 04:01:42,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2019-11-20 04:01:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 04:01:42,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:42,782 INFO L410 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, 1, 1] [2019-11-20 04:01:42,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:01:42,986 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:42,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1495258694, now seen corresponding path program 1 times [2019-11-20 04:01:42,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:01:42,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [659559487] [2019-11-20 04:01:42,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/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-11-20 04:01:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:43,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:01:43,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:01:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:01:43,182 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:01:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:01:43,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [659559487] [2019-11-20 04:01:43,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:43,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 04:01:43,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062527769] [2019-11-20 04:01:43,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:43,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:01:43,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:43,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:43,203 INFO L87 Difference]: Start difference. First operand 217 states and 320 transitions. Second operand 4 states. [2019-11-20 04:01:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:44,452 INFO L93 Difference]: Finished difference Result 528 states and 787 transitions. [2019-11-20 04:01:44,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:44,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-20 04:01:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:44,458 INFO L225 Difference]: With dead ends: 528 [2019-11-20 04:01:44,459 INFO L226 Difference]: Without dead ends: 421 [2019-11-20 04:01:44,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-20 04:01:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-11-20 04:01:44,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-20 04:01:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2019-11-20 04:01:44,520 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 41 [2019-11-20 04:01:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:44,521 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2019-11-20 04:01:44,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2019-11-20 04:01:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 04:01:44,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:44,536 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 04:01:44,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:01:44,738 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash 924360661, now seen corresponding path program 1 times [2019-11-20 04:01:44,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:01:44,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [525067269] [2019-11-20 04:01:44,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/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-11-20 04:01:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:44,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:01:44,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:01:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 04:01:45,019 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:01:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 04:01:45,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [525067269] [2019-11-20 04:01:45,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:45,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 04:01:45,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188902918] [2019-11-20 04:01:45,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:01:45,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:01:45,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:01:45,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:45,054 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2019-11-20 04:01:47,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:47,202 INFO L93 Difference]: Finished difference Result 939 states and 1394 transitions. [2019-11-20 04:01:47,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:01:47,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-20 04:01:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:47,207 INFO L225 Difference]: With dead ends: 939 [2019-11-20 04:01:47,207 INFO L226 Difference]: Without dead ends: 628 [2019-11-20 04:01:47,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:01:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-20 04:01:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-11-20 04:01:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-11-20 04:01:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 927 transitions. [2019-11-20 04:01:47,255 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 927 transitions. Word has length 80 [2019-11-20 04:01:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:47,257 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 927 transitions. [2019-11-20 04:01:47,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:01:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 927 transitions. [2019-11-20 04:01:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 04:01:47,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:47,262 INFO L410 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, 1, 1] [2019-11-20 04:01:47,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:01:47,468 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:47,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2019-11-20 04:01:47,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:01:47,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1250582643] [2019-11-20 04:01:47,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/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-11-20 04:01:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:48,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 04:01:48,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:01:48,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:01:48,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 19 [2019-11-20 04:01:48,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:01:48,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:01:48,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:01:48,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 04:01:48,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:01:48,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 04:01:48,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:01:48,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:01:48,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:01:48,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 04:01:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-20 04:01:48,993 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:01:49,029 INFO L377 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 20 treesize of output 18 [2019-11-20 04:01:49,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:01:49,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:01:49,036 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:01:49,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:01:49,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:01:49,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 04:01:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-20 04:01:49,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1250582643] [2019-11-20 04:01:49,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:49,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-20 04:01:49,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002717277] [2019-11-20 04:01:49,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 04:01:49,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:01:49,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 04:01:49,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 04:01:49,055 INFO L87 Difference]: Start difference. First operand 628 states and 927 transitions. Second operand 7 states. [2019-11-20 04:01:58,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:01:58,045 INFO L93 Difference]: Finished difference Result 2254 states and 3344 transitions. [2019-11-20 04:01:58,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 04:01:58,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-11-20 04:01:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:01:58,058 INFO L225 Difference]: With dead ends: 2254 [2019-11-20 04:01:58,058 INFO L226 Difference]: Without dead ends: 1633 [2019-11-20 04:01:58,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:01:58,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-11-20 04:01:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 784. [2019-11-20 04:01:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-20 04:01:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1203 transitions. [2019-11-20 04:01:58,105 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1203 transitions. Word has length 100 [2019-11-20 04:01:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:01:58,105 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1203 transitions. [2019-11-20 04:01:58,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 04:01:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1203 transitions. [2019-11-20 04:01:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 04:01:58,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:01:58,108 INFO L410 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, 1, 1, 1] [2019-11-20 04:01:58,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:01:58,324 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:01:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:01:58,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1695084872, now seen corresponding path program 1 times [2019-11-20 04:01:58,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:01:58,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2125542201] [2019-11-20 04:01:58,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/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-11-20 04:01:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:01:59,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 04:01:59,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:01:59,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:01:59,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 19 [2019-11-20 04:01:59,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:01:59,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:01:59,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:01:59,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 04:01:59,680 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:01:59,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 04:01:59,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:01:59,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:01:59,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:01:59,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 04:01:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-20 04:01:59,715 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:01:59,753 INFO L377 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 20 treesize of output 18 [2019-11-20 04:01:59,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:01:59,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:01:59,757 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:01:59,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:01:59,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:01:59,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 04:01:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-20 04:01:59,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2125542201] [2019-11-20 04:01:59,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:01:59,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-20 04:01:59,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630817977] [2019-11-20 04:01:59,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 04:01:59,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:01:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 04:01:59,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 04:01:59,779 INFO L87 Difference]: Start difference. First operand 784 states and 1203 transitions. Second operand 7 states. [2019-11-20 04:02:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:02:12,639 INFO L93 Difference]: Finished difference Result 2546 states and 3867 transitions. [2019-11-20 04:02:12,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 04:02:12,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-11-20 04:02:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:02:12,652 INFO L225 Difference]: With dead ends: 2546 [2019-11-20 04:02:12,652 INFO L226 Difference]: Without dead ends: 1769 [2019-11-20 04:02:12,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:02:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2019-11-20 04:02:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 946. [2019-11-20 04:02:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-11-20 04:02:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1491 transitions. [2019-11-20 04:02:12,698 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1491 transitions. Word has length 101 [2019-11-20 04:02:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:02:12,699 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 1491 transitions. [2019-11-20 04:02:12,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 04:02:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1491 transitions. [2019-11-20 04:02:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 04:02:12,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:02:12,707 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2019-11-20 04:02:12,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:02:12,926 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:02:12,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:02:12,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1703481135, now seen corresponding path program 1 times [2019-11-20 04:02:12,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:02:12,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1695141959] [2019-11-20 04:02:12,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/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-11-20 04:02:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:02:14,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:02:14,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:02:14,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:02:14,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:02:14,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:02:14,698 INFO L343 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-20 04:02:14,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2019-11-20 04:02:14,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:02:14,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:14,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:02:14,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-20 04:02:14,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:02:14,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:14,774 INFO L377 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 1 case distinctions, treesize of input 33 treesize of output 26 [2019-11-20 04:02:14,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:02:14,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:14,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:02:14,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-20 04:02:14,801 INFO L377 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 7 [2019-11-20 04:02:14,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:02:14,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:14,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:02:14,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-20 04:02:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 04:02:14,828 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:02:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 04:02:14,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1695141959] [2019-11-20 04:02:14,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:02:14,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 04:02:14,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570654543] [2019-11-20 04:02:14,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 04:02:14,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:02:14,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:02:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:02:14,885 INFO L87 Difference]: Start difference. First operand 946 states and 1491 transitions. Second operand 6 states. [2019-11-20 04:02:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:02:19,589 INFO L93 Difference]: Finished difference Result 2358 states and 3652 transitions. [2019-11-20 04:02:19,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:02:19,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-11-20 04:02:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:02:19,598 INFO L225 Difference]: With dead ends: 2358 [2019-11-20 04:02:19,599 INFO L226 Difference]: Without dead ends: 1573 [2019-11-20 04:02:19,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:02:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2019-11-20 04:02:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1042. [2019-11-20 04:02:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-11-20 04:02:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1641 transitions. [2019-11-20 04:02:19,643 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1641 transitions. Word has length 122 [2019-11-20 04:02:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:02:19,643 INFO L462 AbstractCegarLoop]: Abstraction has 1042 states and 1641 transitions. [2019-11-20 04:02:19,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 04:02:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1641 transitions. [2019-11-20 04:02:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 04:02:19,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:02:19,647 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-11-20 04:02:19,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:02:19,868 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:02:19,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:02:19,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1558577382, now seen corresponding path program 1 times [2019-11-20 04:02:19,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:02:19,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [405542519] [2019-11-20 04:02:19,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/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-11-20 04:02:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:02:21,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:02:21,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:02:21,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:02:21,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:02:21,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:02:21,650 INFO L343 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-20 04:02:21,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2019-11-20 04:02:21,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:02:21,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:21,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:02:21,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-20 04:02:21,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:02:21,686 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:21,687 INFO L377 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 1 case distinctions, treesize of input 33 treesize of output 26 [2019-11-20 04:02:21,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:02:21,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:21,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:02:21,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:13 [2019-11-20 04:02:21,704 INFO L377 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 7 [2019-11-20 04:02:21,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:02:21,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:21,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:02:21,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-20 04:02:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 04:02:21,726 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:02:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 04:02:21,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [405542519] [2019-11-20 04:02:21,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:02:21,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 04:02:21,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778214466] [2019-11-20 04:02:21,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 04:02:21,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:02:21,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:02:21,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:02:21,769 INFO L87 Difference]: Start difference. First operand 1042 states and 1641 transitions. Second operand 6 states. [2019-11-20 04:02:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:02:28,027 INFO L93 Difference]: Finished difference Result 2418 states and 3741 transitions. [2019-11-20 04:02:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:02:28,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-11-20 04:02:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:02:28,036 INFO L225 Difference]: With dead ends: 2418 [2019-11-20 04:02:28,037 INFO L226 Difference]: Without dead ends: 1553 [2019-11-20 04:02:28,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:02:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2019-11-20 04:02:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1048. [2019-11-20 04:02:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-11-20 04:02:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1641 transitions. [2019-11-20 04:02:28,083 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1641 transitions. Word has length 123 [2019-11-20 04:02:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:02:28,084 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1641 transitions. [2019-11-20 04:02:28,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 04:02:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1641 transitions. [2019-11-20 04:02:28,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 04:02:28,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:02:28,088 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2019-11-20 04:02:28,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:02:28,300 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:02:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:02:28,300 INFO L82 PathProgramCache]: Analyzing trace with hash 498183356, now seen corresponding path program 1 times [2019-11-20 04:02:28,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:02:28,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1512019150] [2019-11-20 04:02:28,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/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-11-20 04:02:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:02:30,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:02:30,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:02:30,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-20 04:02:30,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:02:30,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:30,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:02:30,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 04:02:30,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:02:30,182 INFO L377 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 23 treesize of output 22 [2019-11-20 04:02:30,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:02:30,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:30,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:02:30,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 04:02:30,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:30,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 04:02:30,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:02:30,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:02:30,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:02:30,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 04:02:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-20 04:02:30,234 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:02:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-20 04:02:30,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1512019150] [2019-11-20 04:02:30,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:02:30,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-20 04:02:30,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949371294] [2019-11-20 04:02:30,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 04:02:30,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:02:30,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 04:02:30,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:02:30,307 INFO L87 Difference]: Start difference. First operand 1048 states and 1641 transitions. Second operand 8 states. [2019-11-20 04:02:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:02:36,200 INFO L93 Difference]: Finished difference Result 3042 states and 4656 transitions. [2019-11-20 04:02:36,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 04:02:36,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2019-11-20 04:02:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:02:36,212 INFO L225 Difference]: With dead ends: 3042 [2019-11-20 04:02:36,212 INFO L226 Difference]: Without dead ends: 2001 [2019-11-20 04:02:36,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:02:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-11-20 04:02:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1153. [2019-11-20 04:02:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-11-20 04:02:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1799 transitions. [2019-11-20 04:02:36,266 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1799 transitions. Word has length 137 [2019-11-20 04:02:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:02:36,267 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 1799 transitions. [2019-11-20 04:02:36,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 04:02:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1799 transitions. [2019-11-20 04:02:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 04:02:36,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:02:36,271 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2019-11-20 04:02:36,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:02:36,484 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:02:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:02:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-11-20 04:02:36,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:02:36,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [507556493] [2019-11-20 04:02:36,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:02:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:02:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:02:42,074 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 04:02:42,075 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 04:02:42,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:02:42,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:02:42 BoogieIcfgContainer [2019-11-20 04:02:42,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:02:42,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:02:42,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:02:42,442 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:02:42,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:01:42" (3/4) ... [2019-11-20 04:02:42,444 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 04:02:42,568 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_74588a96-463c-4aa6-8cf0-a00b05587b92/bin/uautomizer/witness.graphml [2019-11-20 04:02:42,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:02:42,570 INFO L168 Benchmark]: Toolchain (without parser) took 64701.38 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 956.4 MB in the beginning and 921.7 MB in the end (delta: 34.7 MB). Peak memory consumption was 368.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:02:42,570 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:02:42,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 857.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:02:42,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.06 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 04:02:42,571 INFO L168 Benchmark]: Boogie Preprocessor took 84.38 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 04:02:42,572 INFO L168 Benchmark]: RCFGBuilder took 3304.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 11.5 GB. [2019-11-20 04:02:42,572 INFO L168 Benchmark]: TraceAbstraction took 60249.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.3 MB). Free memory was 1.0 GB in the beginning and 939.1 MB in the end (delta: 103.3 MB). Peak memory consumption was 272.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:02:42,573 INFO L168 Benchmark]: Witness Printer took 127.28 ms. Allocated memory is still 1.4 GB. Free memory was 939.1 MB in the beginning and 921.7 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:02:42,577 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 857.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.06 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.38 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3304.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60249.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.3 MB). Free memory was 1.0 GB in the beginning and 939.1 MB in the end (delta: 103.3 MB). Peak memory consumption was 272.7 MB. Max. memory is 11.5 GB. * Witness Printer took 127.28 ms. Allocated memory is still 1.4 GB. Free memory was 939.1 MB in the beginning and 921.7 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1644]: 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={1341980358: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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [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___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [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] EXPR s->info_callback VAL [init=1, SSLv3_client_data={1341980358:0}] [L1109] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1110] EXPR s->info_callback [L1110] cb = s->info_callback [L1118] EXPR s->in_handshake [L1118] s->in_handshake += 1 [L1119] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={1341980358:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1132] COND TRUE s->state == 12292 [L1235] s->new_session = 1 [L1236] s->state = 4096 [L1237] EXPR s->ctx [L1237] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1237] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1242] s->server = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1243] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={1341980358:0}] [L1248] EXPR s->version VAL [init=1, SSLv3_client_data={1341980358:0}] [L1248] COND FALSE !((s->version & 65280) != 768) [L1254] s->type = 4096 [L1255] EXPR s->init_buf VAL [init=1, SSLv3_client_data={1341980358:0}] [L1255] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1267] tmp___4 = __VERIFIER_nondet_int() [L1268] COND FALSE !(! tmp___4) [L1274] tmp___5 = __VERIFIER_nondet_int() [L1275] COND FALSE !(! tmp___5) [L1281] s->state = 4368 [L1282] EXPR s->ctx [L1282] EXPR (s->ctx)->stats.sess_connect [L1282] (s->ctx)->stats.sess_connect += 1 [L1283] s->init_num = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1147] COND TRUE s->state == 4368 [L1287] s->shutdown = 0 [L1288] ret = __VERIFIER_nondet_int() [L1289] COND TRUE blastFlag == 0 [L1290] blastFlag = 1 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1294] COND FALSE !(ret <= 0) [L1299] s->state = 4384 [L1300] s->init_num = 0 [L1301] EXPR s->bbio [L1301] EXPR s->wbio VAL [init=1, SSLv3_client_data={1341980358:0}] [L1301] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1153] COND TRUE s->state == 4384 [L1309] ret = __VERIFIER_nondet_int() [L1310] COND TRUE blastFlag == 1 [L1311] blastFlag = 2 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1315] COND FALSE !(ret <= 0) [L1320] s->hit VAL [init=1, SSLv3_client_data={1341980358:0}] [L1320] COND FALSE !(s->hit) [L1323] s->state = 4400 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1325] s->init_num = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1159] COND TRUE s->state == 4400 [L1329] EXPR s->s3 [L1329] EXPR (s->s3)->tmp.new_cipher [L1329] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={1341980358:0}] [L1329] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1332] ret = __VERIFIER_nondet_int() [L1333] COND TRUE blastFlag == 2 [L1334] blastFlag = 3 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1338] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={1341980358:0}] [L1344] s->state = 4416 [L1345] s->init_num = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1165] COND TRUE s->state == 4416 [L1349] ret = __VERIFIER_nondet_int() [L1350] COND TRUE blastFlag == 3 [L1351] blastFlag = 4 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1355] COND FALSE !(ret <= 0) [L1360] s->state = 4432 [L1361] s->init_num = 0 [L1362] tmp___6 = __VERIFIER_nondet_int() [L1363] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1171] COND TRUE s->state == 4432 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={1341980358:0}] [L1378] COND FALSE !(ret <= 0) [L1383] s->state = 4448 [L1384] s->init_num = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1341980358:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1171] COND FALSE !(s->state == 4432) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1174] COND FALSE !(s->state == 4433) [L1177] EXPR s->state VAL [init=1, SSLv3_client_data={1341980358:0}] [L1177] COND TRUE s->state == 4448 [L1388] ret = __VERIFIER_nondet_int() [L1389] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={1341980358:0}] [L1644] __VERIFIER_error() VAL [init=1, SSLv3_client_data={1341980358:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Result: UNSAFE, OverallTime: 60.1s, OverallIterations: 9, TraceHistogramMax: 7, AutomataDifference: 42.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1501 SDtfs, 2712 SDslu, 3017 SDs, 0 SdLazy, 2652 SolverSat, 395 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 39.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1456 GetRequests, 1409 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1153occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 3556 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 9.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 865 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1440 ConstructedInterpolants, 0 QuantifiedInterpolants, 460745 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1916 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 1838/1838 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...