./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/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 b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-cad4683 [2019-10-22 08:57:03,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:03,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:03,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:03,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:03,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:03,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:03,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:03,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:03,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:03,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:03,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:03,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:03,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:03,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:03,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:03,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:03,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:03,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:03,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:03,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:03,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:03,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:03,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:03,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:03,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:03,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:03,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:03,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:03,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:03,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:03,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:03,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:03,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:03,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:03,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:03,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:03,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:03,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:03,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:03,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:03,232 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:57:03,242 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:03,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:03,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:03,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:03,244 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:03,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:03,244 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:03,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:03,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:03,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:03,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:57:03,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:57:03,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:57:03,245 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:03,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:03,245 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:03,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:57:03,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:03,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:03,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:57:03,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:57:03,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:03,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:03,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:57:03,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:57:03,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:03,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:57:03,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:57:03,247 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/working_dir_0da70148-4f32-4176-875a-058e95f480cb/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 -> b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd [2019-10-22 08:57:03,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:03,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:03,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:03,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:03,283 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:03,283 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-01-1.i [2019-10-22 08:57:03,326 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/data/135e2c1e3/20031b6001f14fb980a90f591fba011b/FLAG5c90822e4 [2019-10-22 08:57:03,784 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:03,784 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/sv-benchmarks/c/forester-heap/dll-01-1.i [2019-10-22 08:57:03,795 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/data/135e2c1e3/20031b6001f14fb980a90f591fba011b/FLAG5c90822e4 [2019-10-22 08:57:04,303 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/data/135e2c1e3/20031b6001f14fb980a90f591fba011b [2019-10-22 08:57:04,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:04,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:04,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:04,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:04,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:04,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7d5d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04, skipping insertion in model container [2019-10-22 08:57:04,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,324 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:04,366 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:04,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:04,759 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:04,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:04,840 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:04,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04 WrapperNode [2019-10-22 08:57:04,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:04,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:04,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:04,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:04,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:04,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:04,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:04,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:04,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... [2019-10-22 08:57:04,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:04,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:04,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:04,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:04,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/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-10-22 08:57:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:57:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:57:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:57:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:05,507 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:05,508 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-10-22 08:57:05,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:05 BoogieIcfgContainer [2019-10-22 08:57:05,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:05,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:57:05,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:57:05,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:57:05,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:57:04" (1/3) ... [2019-10-22 08:57:05,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d051a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:05, skipping insertion in model container [2019-10-22 08:57:05,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:04" (2/3) ... [2019-10-22 08:57:05,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d051a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:05, skipping insertion in model container [2019-10-22 08:57:05,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:05" (3/3) ... [2019-10-22 08:57:05,515 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2019-10-22 08:57:05,523 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:57:05,530 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-22 08:57:05,539 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-22 08:57:05,561 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:57:05,561 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:57:05,561 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:57:05,561 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:05,562 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:05,562 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:57:05,562 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:05,562 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:57:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-10-22 08:57:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-10-22 08:57:05,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:05,583 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-10-22 08:57:05,585 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2019-10-22 08:57:05,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:05,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054850318] [2019-10-22 08:57:05,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:05,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054850318] [2019-10-22 08:57:05,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:05,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:05,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459070303] [2019-10-22 08:57:05,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:05,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:05,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:05,758 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2019-10-22 08:57:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:05,809 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-10-22 08:57:05,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:05,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-10-22 08:57:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:05,820 INFO L225 Difference]: With dead ends: 180 [2019-10-22 08:57:05,821 INFO L226 Difference]: Without dead ends: 95 [2019-10-22 08:57:05,824 INFO L600 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-10-22 08:57:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-22 08:57:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2019-10-22 08:57:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-22 08:57:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-10-22 08:57:05,859 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2019-10-22 08:57:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:05,859 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-10-22 08:57:05,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-10-22 08:57:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:57:05,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:05,860 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:05,860 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2019-10-22 08:57:05,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:05,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168402211] [2019-10-22 08:57:05,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:05,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168402211] [2019-10-22 08:57:05,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:05,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:05,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937837081] [2019-10-22 08:57:05,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:05,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:05,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:05,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:05,895 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 3 states. [2019-10-22 08:57:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:05,910 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-10-22 08:57:05,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:05,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-22 08:57:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:05,912 INFO L225 Difference]: With dead ends: 80 [2019-10-22 08:57:05,912 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 08:57:05,913 INFO L600 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-10-22 08:57:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 08:57:05,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-22 08:57:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 08:57:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2019-10-22 08:57:05,919 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2019-10-22 08:57:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:05,919 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2019-10-22 08:57:05,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2019-10-22 08:57:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:57:05,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:05,920 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:05,921 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2019-10-22 08:57:05,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:05,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554788728] [2019-10-22 08:57:05,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:05,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:05,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554788728] [2019-10-22 08:57:05,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:05,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:05,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580752003] [2019-10-22 08:57:05,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:05,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:05,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:05,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:05,970 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 4 states. [2019-10-22 08:57:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:06,050 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-10-22 08:57:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:06,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-22 08:57:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:06,052 INFO L225 Difference]: With dead ends: 79 [2019-10-22 08:57:06,052 INFO L226 Difference]: Without dead ends: 77 [2019-10-22 08:57:06,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-22 08:57:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-22 08:57:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-22 08:57:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 08:57:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-10-22 08:57:06,058 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2019-10-22 08:57:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:06,059 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-10-22 08:57:06,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-10-22 08:57:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 08:57:06,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:06,060 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:06,060 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:06,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2019-10-22 08:57:06,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:06,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189189867] [2019-10-22 08:57:06,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:06,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189189867] [2019-10-22 08:57:06,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:06,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:06,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865231579] [2019-10-22 08:57:06,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:06,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:06,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:06,144 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 4 states. [2019-10-22 08:57:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:06,236 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2019-10-22 08:57:06,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:06,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-22 08:57:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:06,238 INFO L225 Difference]: With dead ends: 195 [2019-10-22 08:57:06,238 INFO L226 Difference]: Without dead ends: 128 [2019-10-22 08:57:06,239 INFO L600 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-10-22 08:57:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-22 08:57:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2019-10-22 08:57:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-22 08:57:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-10-22 08:57:06,245 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2019-10-22 08:57:06,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:06,246 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-10-22 08:57:06,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-10-22 08:57:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 08:57:06,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:06,246 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:06,247 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:06,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:06,247 INFO L82 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2019-10-22 08:57:06,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:06,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301727830] [2019-10-22 08:57:06,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:06,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301727830] [2019-10-22 08:57:06,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:06,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:06,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945716090] [2019-10-22 08:57:06,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:06,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:06,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:06,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:06,353 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2019-10-22 08:57:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:06,498 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-10-22 08:57:06,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:06,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-22 08:57:06,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:06,501 INFO L225 Difference]: With dead ends: 122 [2019-10-22 08:57:06,501 INFO L226 Difference]: Without dead ends: 118 [2019-10-22 08:57:06,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:06,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-22 08:57:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2019-10-22 08:57:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 08:57:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-10-22 08:57:06,512 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2019-10-22 08:57:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:06,512 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-10-22 08:57:06,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-10-22 08:57:06,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:57:06,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:06,513 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:06,513 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:06,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2019-10-22 08:57:06,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:06,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792331722] [2019-10-22 08:57:06,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:06,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792331722] [2019-10-22 08:57:06,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:06,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:06,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157900857] [2019-10-22 08:57:06,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:06,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:06,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:06,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:06,588 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2019-10-22 08:57:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:06,662 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-10-22 08:57:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:06,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-22 08:57:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:06,664 INFO L225 Difference]: With dead ends: 132 [2019-10-22 08:57:06,665 INFO L226 Difference]: Without dead ends: 112 [2019-10-22 08:57:06,665 INFO L600 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-10-22 08:57:06,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-22 08:57:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2019-10-22 08:57:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 08:57:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-10-22 08:57:06,675 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2019-10-22 08:57:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:06,675 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-10-22 08:57:06,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-10-22 08:57:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:57:06,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:06,676 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:06,676 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:06,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:06,677 INFO L82 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2019-10-22 08:57:06,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:06,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701869310] [2019-10-22 08:57:06,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:06,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701869310] [2019-10-22 08:57:06,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:06,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:06,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287736612] [2019-10-22 08:57:06,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:06,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:06,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:06,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:06,734 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2019-10-22 08:57:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:06,749 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2019-10-22 08:57:06,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:06,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 08:57:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:06,751 INFO L225 Difference]: With dead ends: 137 [2019-10-22 08:57:06,751 INFO L226 Difference]: Without dead ends: 96 [2019-10-22 08:57:06,752 INFO L600 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-10-22 08:57:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-22 08:57:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2019-10-22 08:57:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 08:57:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-10-22 08:57:06,761 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2019-10-22 08:57:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:06,761 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-10-22 08:57:06,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-10-22 08:57:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:57:06,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:06,761 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:06,762 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:06,762 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2019-10-22 08:57:06,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:06,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123211587] [2019-10-22 08:57:06,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:06,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123211587] [2019-10-22 08:57:06,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:06,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:06,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504300070] [2019-10-22 08:57:06,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:06,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:06,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:06,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:06,825 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2019-10-22 08:57:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:06,842 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2019-10-22 08:57:06,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:06,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 08:57:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:06,844 INFO L225 Difference]: With dead ends: 75 [2019-10-22 08:57:06,844 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 08:57:06,844 INFO L600 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-10-22 08:57:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 08:57:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-22 08:57:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 08:57:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-10-22 08:57:06,856 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2019-10-22 08:57:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:06,856 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-10-22 08:57:06,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-10-22 08:57:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:57:06,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:06,857 INFO L380 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] [2019-10-22 08:57:06,857 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2019-10-22 08:57:06,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:06,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235179778] [2019-10-22 08:57:06,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:06,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:06,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235179778] [2019-10-22 08:57:06,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:06,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:06,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937592169] [2019-10-22 08:57:06,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:06,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:06,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:06,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:06,924 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2019-10-22 08:57:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:06,984 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-10-22 08:57:06,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:06,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-22 08:57:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:06,986 INFO L225 Difference]: With dead ends: 74 [2019-10-22 08:57:06,986 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 08:57:06,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-22 08:57:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 08:57:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-22 08:57:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 08:57:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-10-22 08:57:06,999 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2019-10-22 08:57:07,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:07,000 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-10-22 08:57:07,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-10-22 08:57:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:57:07,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:07,001 INFO L380 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-10-22 08:57:07,001 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2019-10-22 08:57:07,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:07,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596833554] [2019-10-22 08:57:07,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:07,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:07,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:07,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596833554] [2019-10-22 08:57:07,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:07,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:07,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125639282] [2019-10-22 08:57:07,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:07,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:07,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:07,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:07,086 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 6 states. [2019-10-22 08:57:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:07,314 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2019-10-22 08:57:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:57:07,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 08:57:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:07,315 INFO L225 Difference]: With dead ends: 175 [2019-10-22 08:57:07,315 INFO L226 Difference]: Without dead ends: 133 [2019-10-22 08:57:07,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:57:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-22 08:57:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2019-10-22 08:57:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-22 08:57:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2019-10-22 08:57:07,331 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2019-10-22 08:57:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:07,331 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2019-10-22 08:57:07,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2019-10-22 08:57:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:57:07,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:07,332 INFO L380 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-10-22 08:57:07,332 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:07,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2019-10-22 08:57:07,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:07,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497094868] [2019-10-22 08:57:07,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:07,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:07,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:07,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497094868] [2019-10-22 08:57:07,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:07,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:57:07,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190025687] [2019-10-22 08:57:07,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:57:07,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:07,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:57:07,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:57:07,553 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 8 states. [2019-10-22 08:57:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:08,244 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2019-10-22 08:57:08,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:57:08,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-10-22 08:57:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:08,248 INFO L225 Difference]: With dead ends: 171 [2019-10-22 08:57:08,248 INFO L226 Difference]: Without dead ends: 169 [2019-10-22 08:57:08,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-10-22 08:57:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-22 08:57:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 100. [2019-10-22 08:57:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-22 08:57:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2019-10-22 08:57:08,268 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 24 [2019-10-22 08:57:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:08,268 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2019-10-22 08:57:08,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:57:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2019-10-22 08:57:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:57:08,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:08,269 INFO L380 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, 1, 1] [2019-10-22 08:57:08,270 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2019-10-22 08:57:08,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163118502] [2019-10-22 08:57:08,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:57:08,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163118502] [2019-10-22 08:57:08,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:08,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:08,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111151286] [2019-10-22 08:57:08,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:08,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:08,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:08,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:08,332 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand 5 states. [2019-10-22 08:57:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:08,440 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2019-10-22 08:57:08,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:57:08,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-22 08:57:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:08,441 INFO L225 Difference]: With dead ends: 146 [2019-10-22 08:57:08,441 INFO L226 Difference]: Without dead ends: 128 [2019-10-22 08:57:08,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-22 08:57:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2019-10-22 08:57:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-22 08:57:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2019-10-22 08:57:08,448 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 26 [2019-10-22 08:57:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:08,448 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2019-10-22 08:57:08,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2019-10-22 08:57:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:57:08,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:08,449 INFO L380 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, 1, 1] [2019-10-22 08:57:08,449 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2019-10-22 08:57:08,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602727521] [2019-10-22 08:57:08,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:57:08,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602727521] [2019-10-22 08:57:08,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:08,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:08,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755425624] [2019-10-22 08:57:08,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:08,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:08,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:08,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:08,484 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand 3 states. [2019-10-22 08:57:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:08,528 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2019-10-22 08:57:08,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:08,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 08:57:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:08,534 INFO L225 Difference]: With dead ends: 120 [2019-10-22 08:57:08,534 INFO L226 Difference]: Without dead ends: 118 [2019-10-22 08:57:08,534 INFO L600 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-10-22 08:57:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-22 08:57:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-10-22 08:57:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-22 08:57:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2019-10-22 08:57:08,542 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 26 [2019-10-22 08:57:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:08,543 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-10-22 08:57:08,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2019-10-22 08:57:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:57:08,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:08,543 INFO L380 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, 1, 1, 1] [2019-10-22 08:57:08,544 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,544 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2019-10-22 08:57:08,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330402485] [2019-10-22 08:57:08,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:08,604 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:08,604 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:57:08,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:08 BoogieIcfgContainer [2019-10-22 08:57:08,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:08,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:08,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:08,633 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:08,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:05" (3/4) ... [2019-10-22 08:57:08,636 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:57:08,682 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0da70148-4f32-4176-875a-058e95f480cb/bin/uautomizer/witness.graphml [2019-10-22 08:57:08,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:08,684 INFO L168 Benchmark]: Toolchain (without parser) took 4375.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.5 MB in the beginning and 968.4 MB in the end (delta: -23.9 MB). Peak memory consumption was 119.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:08,684 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:08,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 532.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:08,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.84 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:08,685 INFO L168 Benchmark]: Boogie Preprocessor took 44.22 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-10-22 08:57:08,685 INFO L168 Benchmark]: RCFGBuilder took 568.19 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:08,686 INFO L168 Benchmark]: TraceAbstraction took 3122.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.1 MB in the end (delta: 111.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:08,686 INFO L168 Benchmark]: Witness Printer took 49.17 ms. Allocated memory is still 1.2 GB. Free memory was 970.1 MB in the beginning and 968.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:08,691 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 532.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.84 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.22 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. * RCFGBuilder took 568.19 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3122.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.1 MB in the end (delta: 111.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. * Witness Printer took 49.17 ms. Allocated memory is still 1.2 GB. Free memory was 970.1 MB in the beginning and 968.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) [L995] COND FALSE !(!(list != ((void*)0))) [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list [L1015] COND FALSE !(!(((void*)0) != end)) [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner [L1023] COND TRUE len == 0 [L1024] len = 1 [L1027] COND FALSE !(!(((void*)0) != inner)) [L1028] EXPR inner->inner [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 13 error locations. Result: UNSAFE, OverallTime: 3.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 914 SDtfs, 940 SDslu, 1206 SDs, 0 SdLazy, 618 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 307 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 35681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 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...