./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.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_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/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 d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:59:04,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:04,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:04,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:04,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:04,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:04,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:04,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:04,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:04,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:04,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:04,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:04,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:04,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:04,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:04,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:04,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:04,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:04,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:04,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:04,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:04,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:04,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:04,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:04,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:04,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:04,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:04,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:04,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:04,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:04,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:04,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:04,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:04,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:04,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:04,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:04,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:04,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:04,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:04,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:04,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:04,254 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:59:04,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:04,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:04,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:04,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:04,266 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:04,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:04,267 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:04,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:04,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:04,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:04,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:59:04,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:59:04,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:59:04,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:04,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:04,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:04,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:59:04,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:04,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:04,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:59:04,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:59:04,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:59:04,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:04,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:59:04,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:59:04,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:04,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:59:04,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:59:04,274 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_d232b701-a8a0-4cc6-bc28-bb82a264878d/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 -> d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 [2019-10-22 08:59:04,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:04,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:04,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:04,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:04,321 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:04,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-10-22 08:59:04,379 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/data/42e305620/873071282fd549ec9b757ebe0f3dfc64/FLAG37b1b504b [2019-10-22 08:59:04,772 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:04,773 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-10-22 08:59:04,784 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/data/42e305620/873071282fd549ec9b757ebe0f3dfc64/FLAG37b1b504b [2019-10-22 08:59:04,796 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/data/42e305620/873071282fd549ec9b757ebe0f3dfc64 [2019-10-22 08:59:04,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:04,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:04,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:04,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:04,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:04,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6447617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:04, skipping insertion in model container [2019-10-22 08:59:04,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:04" (1/1) ... [2019-10-22 08:59:04,815 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:04,847 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:05,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:05,180 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:05,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:05,264 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:05,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05 WrapperNode [2019-10-22 08:59:05,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:05,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:05,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:05,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:05,273 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:59:05" (1/1) ... [2019-10-22 08:59:05,285 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:59:05" (1/1) ... [2019-10-22 08:59:05,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:05,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:05,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:05,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:05,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05" (1/1) ... [2019-10-22 08:59:05,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05" (1/1) ... [2019-10-22 08:59:05,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05" (1/1) ... [2019-10-22 08:59:05,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05" (1/1) ... [2019-10-22 08:59:05,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05" (1/1) ... [2019-10-22 08:59:05,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05" (1/1) ... [2019-10-22 08:59:05,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05" (1/1) ... [2019-10-22 08:59:05,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:05,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:05,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:05,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:05,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/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:59:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:59:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:59:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:59:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:05,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:05,782 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:05,782 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-22 08:59:05,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:05 BoogieIcfgContainer [2019-10-22 08:59:05,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:05,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:59:05,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:59:05,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:59:05,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:59:04" (1/3) ... [2019-10-22 08:59:05,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510ad624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:05, skipping insertion in model container [2019-10-22 08:59:05,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05" (2/3) ... [2019-10-22 08:59:05,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510ad624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:05, skipping insertion in model container [2019-10-22 08:59:05,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:05" (3/3) ... [2019-10-22 08:59:05,791 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2019-10-22 08:59:05,800 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:59:05,809 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-22 08:59:05,820 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-22 08:59:05,841 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:59:05,841 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:59:05,841 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:59:05,841 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:05,841 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:05,841 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:59:05,842 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:05,842 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:59:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-22 08:59:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 08:59:05,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,861 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,864 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2019-10-22 08:59:05,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258066810] [2019-10-22 08:59:05,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,007 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:59:06,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258066810] [2019-10-22 08:59:06,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:06,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833178164] [2019-10-22 08:59:06,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 08:59:06,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:59:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:59:06,025 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-10-22 08:59:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,040 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2019-10-22 08:59:06,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:59:06,041 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 08:59:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,050 INFO L225 Difference]: With dead ends: 61 [2019-10-22 08:59:06,051 INFO L226 Difference]: Without dead ends: 27 [2019-10-22 08:59:06,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:59:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-22 08:59:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 08:59:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:59:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-22 08:59:06,085 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2019-10-22 08:59:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,085 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-22 08:59:06,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 08:59:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-22 08:59:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 08:59:06,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,086 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,086 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2019-10-22 08:59:06,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986823410] [2019-10-22 08:59:06,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,146 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:59:06,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986823410] [2019-10-22 08:59:06,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:06,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015728080] [2019-10-22 08:59:06,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:06,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:06,149 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-10-22 08:59:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,228 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-10-22 08:59:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:06,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 08:59:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,230 INFO L225 Difference]: With dead ends: 33 [2019-10-22 08:59:06,230 INFO L226 Difference]: Without dead ends: 31 [2019-10-22 08:59:06,231 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:59:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-22 08:59:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-10-22 08:59:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:59:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-22 08:59:06,235 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2019-10-22 08:59:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,235 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-22 08:59:06,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-22 08:59:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:59:06,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,237 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,238 INFO L82 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2019-10-22 08:59:06,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294840172] [2019-10-22 08:59:06,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,350 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:59:06,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294840172] [2019-10-22 08:59:06,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:06,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:06,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049692763] [2019-10-22 08:59:06,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:59:06,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:06,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:06,352 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-10-22 08:59:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,505 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-10-22 08:59:06,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:59:06,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-22 08:59:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:06,507 INFO L225 Difference]: With dead ends: 50 [2019-10-22 08:59:06,507 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 08:59:06,507 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:59:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 08:59:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-10-22 08:59:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:59:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-22 08:59:06,517 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2019-10-22 08:59:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:06,517 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-22 08:59:06,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:59:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-22 08:59:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 08:59:06,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:06,518 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,518 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:06,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2019-10-22 08:59:06,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294266076] [2019-10-22 08:59:06,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:06,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294266076] [2019-10-22 08:59:06,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378908683] [2019-10-22 08:59:06,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:06,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-22 08:59:06,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:06,940 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 08:59:06,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-22 08:59:06,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:06,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:06,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-22 08:59:06,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:06,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:06,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:06,984 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:29 [2019-10-22 08:59:07,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:07,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 08:59:07,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:07,117 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-10-22 08:59:07,126 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:07,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:07,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:07,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-10-22 08:59:07,160 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:07,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:07,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:07,177 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-10-22 08:59:07,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:07,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-22 08:59:07,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:07,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:07,279 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_27|], 2=[|v_#memory_int_28|], 4=[|v_#memory_int_30|]} [2019-10-22 08:59:07,289 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:07,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:07,321 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:07,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:07,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:07,366 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-22 08:59:07,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2019-10-22 08:59:07,367 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:07,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:07,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:07,389 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:78, output treesize:41 [2019-10-22 08:59:07,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-10-22 08:59:07,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:07,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:07,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:07,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2019-10-22 08:59:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,489 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:07,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-10-22 08:59:07,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089188910] [2019-10-22 08:59:07,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 08:59:07,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:07,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:59:07,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:59:07,491 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 11 states. [2019-10-22 08:59:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:07,931 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-10-22 08:59:07,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:59:07,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-10-22 08:59:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:07,933 INFO L225 Difference]: With dead ends: 58 [2019-10-22 08:59:07,933 INFO L226 Difference]: Without dead ends: 56 [2019-10-22 08:59:07,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:59:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-22 08:59:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 23. [2019-10-22 08:59:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:59:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-22 08:59:07,939 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2019-10-22 08:59:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:07,940 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-22 08:59:07,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 08:59:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-10-22 08:59:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:59:07,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:07,940 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:08,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:08,142 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:08,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1689639521, now seen corresponding path program 1 times [2019-10-22 08:59:08,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888583180] [2019-10-22 08:59:08,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:08,218 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:59:08,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888583180] [2019-10-22 08:59:08,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:08,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:08,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646454768] [2019-10-22 08:59:08,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:59:08,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:08,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:08,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:08,221 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2019-10-22 08:59:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:08,321 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-10-22 08:59:08,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:08,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 08:59:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:08,323 INFO L225 Difference]: With dead ends: 38 [2019-10-22 08:59:08,323 INFO L226 Difference]: Without dead ends: 26 [2019-10-22 08:59:08,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-22 08:59:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-10-22 08:59:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:59:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-22 08:59:08,328 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2019-10-22 08:59:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:08,328 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-22 08:59:08,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:59:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-22 08:59:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 08:59:08,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:08,329 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:08,329 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2084817261, now seen corresponding path program 1 times [2019-10-22 08:59:08,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247218686] [2019-10-22 08:59:08,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:08,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247218686] [2019-10-22 08:59:08,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79033662] [2019-10-22 08:59:08,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:08,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:59:08,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:08,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:08,501 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-10-22 08:59:08,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 48 [2019-10-22 08:59:08,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:08,553 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.4 percent of original size [2019-10-22 08:59:08,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:08,608 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-10-22 08:59:08,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 48 [2019-10-22 08:59:08,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:08,666 INFO L567 ElimStorePlain]: treesize reduction 16, result has 79.7 percent of original size [2019-10-22 08:59:08,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:08,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:63 [2019-10-22 08:59:08,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 08:59:08,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 08:59:08,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-10-22 08:59:08,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:08,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:08,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2019-10-22 08:59:08,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:08,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-10-22 08:59:08,770 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:08,810 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2019-10-22 08:59:08,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-10-22 08:59:08,815 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:08,825 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:08,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2019-10-22 08:59:08,827 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:08,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-22 08:59:08,832 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:08,844 INFO L567 ElimStorePlain]: treesize reduction 20, result has 25.9 percent of original size [2019-10-22 08:59:08,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:08,845 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:110, output treesize:7 [2019-10-22 08:59:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:08,862 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:08,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-22 08:59:08,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286212926] [2019-10-22 08:59:08,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:59:08,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:08,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:59:08,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:59:08,863 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-10-22 08:59:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:09,136 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-10-22 08:59:09,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:59:09,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-22 08:59:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:09,138 INFO L225 Difference]: With dead ends: 49 [2019-10-22 08:59:09,138 INFO L226 Difference]: Without dead ends: 27 [2019-10-22 08:59:09,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:59:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-22 08:59:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 08:59:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:59:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-22 08:59:09,143 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-10-22 08:59:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:09,143 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-22 08:59:09,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:59:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-22 08:59:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:59:09,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:09,144 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:09,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:09,345 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:09,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1088473273, now seen corresponding path program 1 times [2019-10-22 08:59:09,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455768649] [2019-10-22 08:59:09,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:09,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455768649] [2019-10-22 08:59:09,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865485452] [2019-10-22 08:59:09,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-22 08:59:09,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:09,682 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 08:59:09,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-22 08:59:09,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:09,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:09,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:09,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-10-22 08:59:09,770 INFO L341 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-10-22 08:59:09,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-10-22 08:59:09,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:09,825 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.3 percent of original size [2019-10-22 08:59:09,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-22 08:59:09,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:09,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:09,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-22 08:59:09,862 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:09,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:09,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:09,879 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:55 [2019-10-22 08:59:09,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:09,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 49 [2019-10-22 08:59:09,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:10,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:10,019 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:10,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:10,253 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-22 08:59:10,253 INFO L341 Elim1Store]: treesize reduction 131, result has 48.2 percent of original size [2019-10-22 08:59:10,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 185 treesize of output 197 [2019-10-22 08:59:10,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 08:59:10,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:10,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 08:59:10,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 08:59:10,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 08:59:10,260 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:10,454 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-10-22 08:59:10,454 INFO L567 ElimStorePlain]: treesize reduction 1470, result has 9.8 percent of original size [2019-10-22 08:59:10,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 122 [2019-10-22 08:59:10,461 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:10,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:10,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:10,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 29 [2019-10-22 08:59:10,500 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:10,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:10,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:10,519 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:229, output treesize:79 [2019-10-22 08:59:10,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:59:10,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:10,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:10,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:10,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:93, output treesize:82 [2019-10-22 08:59:10,685 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:10,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 69 [2019-10-22 08:59:10,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:10,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:10,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:10,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:10,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:10,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:10,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:10,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:10,689 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:10,725 INFO L567 ElimStorePlain]: treesize reduction 36, result has 36.8 percent of original size [2019-10-22 08:59:10,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:10,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:4 [2019-10-22 08:59:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:10,731 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:10,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-10-22 08:59:10,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257005297] [2019-10-22 08:59:10,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 08:59:10,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:10,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:59:10,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:59:10,734 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 15 states. [2019-10-22 08:59:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:11,553 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2019-10-22 08:59:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:59:11,553 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2019-10-22 08:59:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:11,554 INFO L225 Difference]: With dead ends: 84 [2019-10-22 08:59:11,554 INFO L226 Difference]: Without dead ends: 82 [2019-10-22 08:59:11,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-10-22 08:59:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-22 08:59:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 42. [2019-10-22 08:59:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 08:59:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-10-22 08:59:11,565 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2019-10-22 08:59:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:11,566 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-10-22 08:59:11,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 08:59:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-10-22 08:59:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:59:11,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:11,566 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:11,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:11,767 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:11,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,767 INFO L82 PathProgramCache]: Analyzing trace with hash -67404919, now seen corresponding path program 1 times [2019-10-22 08:59:11,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78846686] [2019-10-22 08:59:11,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:11,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78846686] [2019-10-22 08:59:11,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514756050] [2019-10-22 08:59:11,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:12,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-22 08:59:12,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:12,055 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 08:59:12,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-22 08:59:12,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:12,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2019-10-22 08:59:12,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 08:59:12,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-22 08:59:12,158 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-22 08:59:12,178 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,190 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:29 [2019-10-22 08:59:12,213 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_$Pointer$.base_27|], 4=[|v_#memory_$Pointer$.offset_27|]} [2019-10-22 08:59:12,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-10-22 08:59:12,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 83 [2019-10-22 08:59:12,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:12,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,262 INFO L567 ElimStorePlain]: treesize reduction 28, result has 69.9 percent of original size [2019-10-22 08:59:12,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2019-10-22 08:59:12,267 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,274 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:100, output treesize:38 [2019-10-22 08:59:12,348 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-10-22 08:59:12,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-10-22 08:59:12,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-22 08:59:12,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:11 [2019-10-22 08:59:12,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:59:12,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:12,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:12,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-22 08:59:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:12,443 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:12,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-10-22 08:59:12,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961131340] [2019-10-22 08:59:12,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 08:59:12,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:12,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 08:59:12,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-22 08:59:12,445 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 18 states. [2019-10-22 08:59:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:13,099 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-10-22 08:59:13,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:59:13,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-10-22 08:59:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:13,101 INFO L225 Difference]: With dead ends: 83 [2019-10-22 08:59:13,101 INFO L226 Difference]: Without dead ends: 71 [2019-10-22 08:59:13,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2019-10-22 08:59:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-22 08:59:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-10-22 08:59:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 08:59:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-10-22 08:59:13,118 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 20 [2019-10-22 08:59:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:13,118 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-10-22 08:59:13,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 08:59:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-10-22 08:59:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:59:13,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:13,119 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:13,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:13,320 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 299800945, now seen corresponding path program 1 times [2019-10-22 08:59:13,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:13,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656386180] [2019-10-22 08:59:13,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:13,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:13,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:13,386 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:13,387 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:59:13,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:59:13 BoogieIcfgContainer [2019-10-22 08:59:13,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:59:13,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:13,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:13,422 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:13,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:05" (3/4) ... [2019-10-22 08:59:13,425 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:59:13,492 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d232b701-a8a0-4cc6-bc28-bb82a264878d/bin/uautomizer/witness.graphml [2019-10-22 08:59:13,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:13,493 INFO L168 Benchmark]: Toolchain (without parser) took 8693.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 940.4 MB in the beginning and 1.0 GB in the end (delta: -87.2 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,493 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 959.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:13,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 464.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.21 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,494 INFO L168 Benchmark]: Boogie Preprocessor took 32.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,494 INFO L168 Benchmark]: RCFGBuilder took 448.95 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,494 INFO L168 Benchmark]: TraceAbstraction took 7637.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.7 MB). Peak memory consumption was 94.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,495 INFO L168 Benchmark]: Witness Printer took 69.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,499 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 959.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 464.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.21 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 448.95 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7637.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.7 MB). Peak memory consumption was 94.9 MB. Max. memory is 11.5 GB. * Witness Printer took 69.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1039]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* null = malloc(sizeof(SLL)); [L995] null->colour = BLACK [L996] null->next = ((void*)0) [L998] SLL* list = malloc(sizeof(SLL)); [L999] list->next = null [L1000] list->colour = BLACK [L1002] SLL* end = list; [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] end->next = malloc(sizeof(SLL)) [L1009] EXPR end->next [L1009] end = end->next [L1010] end->next = null [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] end->colour = RED [L1019] end->next = malloc(sizeof(SLL)) [L1020] EXPR end->next [L1020] end = end->next [L1021] end->next = null [L1022] end->colour = BLACK [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list [L1030] COND FALSE !(!(null != end)) [L1031] EXPR end->colour [L1031] COND FALSE !(!(BLACK == end->colour)) [L1033] COND TRUE null != end [L1035] EXPR end->colour [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR end->next [L1042] end = end->next [L1033] COND TRUE null != end [L1035] EXPR end->colour [L1035] COND TRUE RED == end->colour [L1037] EXPR end->next [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) [L1039] EXPR end->colour [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 4 error locations. Result: UNSAFE, OverallTime: 7.5s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 201 SDtfs, 315 SDslu, 783 SDs, 0 SdLazy, 873 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 114 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 165 ConstructedInterpolants, 19 QuantifiedInterpolants, 69554 SizeOfPredicates, 50 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 2/24 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...