./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c --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_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/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 2593a15d06c58660fbfd01a80d97fe77e908cd97 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:54,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:54,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:54,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:54,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:54,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:54,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:54,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:54,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:54,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:54,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:54,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:54,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:54,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:54,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:54,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:54,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:54,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:54,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:54,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:54,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:54,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:54,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:54,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:54,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:54,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:54,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:54,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:54,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:54,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:54,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:54,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:54,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:54,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:54,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:54,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:54,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:54,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:54,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:54,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:54,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:54,270 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:00:54,284 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:54,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:54,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:54,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:54,287 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:54,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:54,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:54,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:54,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:54,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:54,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:00:54,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:00:54,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:00:54,289 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:54,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:54,289 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:54,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:00:54,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:54,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:54,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:00:54,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:00:54,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:00:54,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:54,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:00:54,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:00:54,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:54,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:00:54,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:00:54,292 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_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/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 -> 2593a15d06c58660fbfd01a80d97fe77e908cd97 [2019-10-22 09:00:54,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:54,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:54,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:54,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:54,344 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:54,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c [2019-10-22 09:00:54,403 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/data/876b3e985/99dff1b7e5c849d4bf9722986f7c9d5a/FLAGd97d16b47 [2019-10-22 09:00:54,800 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:54,802 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c [2019-10-22 09:00:54,813 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/data/876b3e985/99dff1b7e5c849d4bf9722986f7c9d5a/FLAGd97d16b47 [2019-10-22 09:00:55,148 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/data/876b3e985/99dff1b7e5c849d4bf9722986f7c9d5a [2019-10-22 09:00:55,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:55,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:55,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:55,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:55,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:55,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fb289e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55, skipping insertion in model container [2019-10-22 09:00:55,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,168 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:55,204 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:55,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:55,461 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:55,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:55,534 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:55,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55 WrapperNode [2019-10-22 09:00:55,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:55,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:55,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:55,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:55,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:55,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:55,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:55,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:55,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (1/1) ... [2019-10-22 09:00:55,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:55,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:55,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:55,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:55,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/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 09:00:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:55,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:55,763 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:00:56,225 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 09:00:56,226 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 09:00:56,227 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:56,227 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:00:56,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:56 BoogieIcfgContainer [2019-10-22 09:00:56,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:56,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:00:56,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:00:56,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:00:56,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:00:55" (1/3) ... [2019-10-22 09:00:56,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16308f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:56, skipping insertion in model container [2019-10-22 09:00:56,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:55" (2/3) ... [2019-10-22 09:00:56,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16308f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:56, skipping insertion in model container [2019-10-22 09:00:56,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:56" (3/3) ... [2019-10-22 09:00:56,236 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-10-22 09:00:56,244 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:00:56,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:00:56,261 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:00:56,286 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:00:56,287 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:00:56,288 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:00:56,288 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:56,288 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:56,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:00:56,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:56,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:00:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-10-22 09:00:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:00:56,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:56,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:56,314 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-10-22 09:00:56,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:56,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966644788] [2019-10-22 09:00:56,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:56,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:56,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:56,462 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 09:00:56,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966644788] [2019-10-22 09:00:56,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:56,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:56,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788446078] [2019-10-22 09:00:56,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:56,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:56,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:56,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:56,484 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-10-22 09:00:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:56,696 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-10-22 09:00:56,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:56,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:00:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:56,712 INFO L225 Difference]: With dead ends: 251 [2019-10-22 09:00:56,712 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 09:00:56,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 09:00:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-10-22 09:00:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 09:00:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-10-22 09:00:56,765 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-10-22 09:00:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:56,765 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-10-22 09:00:56,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-10-22 09:00:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 09:00:56,766 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:56,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:56,767 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:56,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-10-22 09:00:56,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:56,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034853993] [2019-10-22 09:00:56,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:56,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:56,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:56,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034853993] [2019-10-22 09:00:56,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:56,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:56,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17428777] [2019-10-22 09:00:56,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:56,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:56,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:56,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:56,856 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-10-22 09:00:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:57,011 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-10-22 09:00:57,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:57,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 09:00:57,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:57,013 INFO L225 Difference]: With dead ends: 237 [2019-10-22 09:00:57,014 INFO L226 Difference]: Without dead ends: 132 [2019-10-22 09:00:57,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-22 09:00:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-10-22 09:00:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-22 09:00:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-10-22 09:00:57,031 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-10-22 09:00:57,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:57,032 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-10-22 09:00:57,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-10-22 09:00:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 09:00:57,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:57,033 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:57,033 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-10-22 09:00:57,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558368847] [2019-10-22 09:00:57,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:00:57,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558368847] [2019-10-22 09:00:57,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:57,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:57,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351666100] [2019-10-22 09:00:57,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:57,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:57,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:57,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:57,101 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-10-22 09:00:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:57,255 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2019-10-22 09:00:57,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:57,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 09:00:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:57,258 INFO L225 Difference]: With dead ends: 271 [2019-10-22 09:00:57,258 INFO L226 Difference]: Without dead ends: 151 [2019-10-22 09:00:57,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-22 09:00:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-10-22 09:00:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-22 09:00:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-10-22 09:00:57,278 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-10-22 09:00:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:57,285 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-10-22 09:00:57,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-10-22 09:00:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:00:57,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:57,287 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:57,287 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:57,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times [2019-10-22 09:00:57,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844249667] [2019-10-22 09:00:57,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 09:00:57,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844249667] [2019-10-22 09:00:57,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:57,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:57,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686662605] [2019-10-22 09:00:57,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:57,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:57,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:57,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:57,419 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-10-22 09:00:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:57,622 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-10-22 09:00:57,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:57,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 09:00:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:57,625 INFO L225 Difference]: With dead ends: 334 [2019-10-22 09:00:57,625 INFO L226 Difference]: Without dead ends: 196 [2019-10-22 09:00:57,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-22 09:00:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-10-22 09:00:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-22 09:00:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-10-22 09:00:57,656 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-10-22 09:00:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:57,657 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-10-22 09:00:57,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-10-22 09:00:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:00:57,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:57,662 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:57,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times [2019-10-22 09:00:57,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065509772] [2019-10-22 09:00:57,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 09:00:57,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065509772] [2019-10-22 09:00:57,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:57,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:57,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771850801] [2019-10-22 09:00:57,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:57,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:57,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:57,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:57,719 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-10-22 09:00:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:57,839 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-10-22 09:00:57,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:57,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 09:00:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:57,841 INFO L225 Difference]: With dead ends: 389 [2019-10-22 09:00:57,841 INFO L226 Difference]: Without dead ends: 211 [2019-10-22 09:00:57,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-22 09:00:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-10-22 09:00:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-22 09:00:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-10-22 09:00:57,857 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-10-22 09:00:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:57,857 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-10-22 09:00:57,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-10-22 09:00:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:00:57,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:57,865 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:57,865 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times [2019-10-22 09:00:57,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470495010] [2019-10-22 09:00:57,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 09:00:57,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470495010] [2019-10-22 09:00:57,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:57,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:57,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093401695] [2019-10-22 09:00:57,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:57,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:57,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:57,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:57,978 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-10-22 09:00:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:58,099 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-10-22 09:00:58,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:58,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 09:00:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:58,100 INFO L225 Difference]: With dead ends: 427 [2019-10-22 09:00:58,101 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 09:00:58,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 09:00:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-10-22 09:00:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-22 09:00:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-10-22 09:00:58,108 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-10-22 09:00:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:58,109 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-10-22 09:00:58,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-10-22 09:00:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 09:00:58,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:58,111 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:58,111 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:58,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,111 INFO L82 PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times [2019-10-22 09:00:58,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731301645] [2019-10-22 09:00:58,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 09:00:58,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731301645] [2019-10-22 09:00:58,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:58,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:58,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472471006] [2019-10-22 09:00:58,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:58,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:58,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:58,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,163 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-10-22 09:00:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:58,195 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-10-22 09:00:58,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:58,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 09:00:58,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:58,197 INFO L225 Difference]: With dead ends: 661 [2019-10-22 09:00:58,198 INFO L226 Difference]: Without dead ends: 443 [2019-10-22 09:00:58,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-22 09:00:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-10-22 09:00:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-10-22 09:00:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-10-22 09:00:58,212 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-10-22 09:00:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:58,212 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-10-22 09:00:58,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-10-22 09:00:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 09:00:58,214 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:58,214 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:58,214 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times [2019-10-22 09:00:58,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923966389] [2019-10-22 09:00:58,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 09:00:58,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923966389] [2019-10-22 09:00:58,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:58,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:58,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682792013] [2019-10-22 09:00:58,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:58,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:58,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:58,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,286 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-10-22 09:00:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:58,320 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-10-22 09:00:58,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:58,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 09:00:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:58,323 INFO L225 Difference]: With dead ends: 661 [2019-10-22 09:00:58,323 INFO L226 Difference]: Without dead ends: 659 [2019-10-22 09:00:58,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-22 09:00:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-10-22 09:00:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-22 09:00:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-10-22 09:00:58,340 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-10-22 09:00:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:58,340 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-10-22 09:00:58,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-10-22 09:00:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-22 09:00:58,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:58,343 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:58,343 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash 589479754, now seen corresponding path program 1 times [2019-10-22 09:00:58,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904823575] [2019-10-22 09:00:58,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-22 09:00:58,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904823575] [2019-10-22 09:00:58,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:58,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:58,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876262385] [2019-10-22 09:00:58,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:58,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:58,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:58,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,406 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-10-22 09:00:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:58,561 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-10-22 09:00:58,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:58,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-22 09:00:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:58,565 INFO L225 Difference]: With dead ends: 1462 [2019-10-22 09:00:58,565 INFO L226 Difference]: Without dead ends: 809 [2019-10-22 09:00:58,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-10-22 09:00:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-10-22 09:00:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-22 09:00:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-10-22 09:00:58,588 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 161 [2019-10-22 09:00:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:58,588 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-10-22 09:00:58,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-10-22 09:00:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-22 09:00:58,591 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:58,591 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:58,591 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1596288335, now seen corresponding path program 1 times [2019-10-22 09:00:58,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324462679] [2019-10-22 09:00:58,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-22 09:00:58,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324462679] [2019-10-22 09:00:58,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:58,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:58,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671207365] [2019-10-22 09:00:58,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:58,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,666 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-10-22 09:00:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:58,852 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-10-22 09:00:58,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:58,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-22 09:00:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:58,856 INFO L225 Difference]: With dead ends: 1824 [2019-10-22 09:00:58,856 INFO L226 Difference]: Without dead ends: 1006 [2019-10-22 09:00:58,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-10-22 09:00:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-10-22 09:00:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-10-22 09:00:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-10-22 09:00:58,881 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-10-22 09:00:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:58,881 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-10-22 09:00:58,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-10-22 09:00:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-22 09:00:58,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:58,884 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:58,885 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:58,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1275827432, now seen corresponding path program 1 times [2019-10-22 09:00:58,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:58,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532406644] [2019-10-22 09:00:58,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:58,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-22 09:00:58,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532406644] [2019-10-22 09:00:58,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:58,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:58,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088236523] [2019-10-22 09:00:58,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:58,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:58,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:58,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:58,951 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-10-22 09:00:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:59,123 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-10-22 09:00:59,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:59,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-22 09:00:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:59,128 INFO L225 Difference]: With dead ends: 2080 [2019-10-22 09:00:59,128 INFO L226 Difference]: Without dead ends: 1079 [2019-10-22 09:00:59,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-10-22 09:00:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-10-22 09:00:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-10-22 09:00:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-10-22 09:00:59,153 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-10-22 09:00:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:59,153 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-10-22 09:00:59,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-10-22 09:00:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-22 09:00:59,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:59,157 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:59,158 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:59,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1859847365, now seen corresponding path program 1 times [2019-10-22 09:00:59,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454231871] [2019-10-22 09:00:59,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-10-22 09:00:59,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454231871] [2019-10-22 09:00:59,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:59,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:59,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10657120] [2019-10-22 09:00:59,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:59,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:59,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:59,228 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-10-22 09:00:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:59,372 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-10-22 09:00:59,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:59,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-22 09:00:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:59,376 INFO L225 Difference]: With dead ends: 2230 [2019-10-22 09:00:59,376 INFO L226 Difference]: Without dead ends: 1160 [2019-10-22 09:00:59,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-10-22 09:00:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-10-22 09:00:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-22 09:00:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-10-22 09:00:59,403 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-10-22 09:00:59,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:59,403 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-10-22 09:00:59,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-10-22 09:00:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-22 09:00:59,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:59,406 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:59,407 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1978288839, now seen corresponding path program 1 times [2019-10-22 09:00:59,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995772837] [2019-10-22 09:00:59,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-10-22 09:00:59,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995772837] [2019-10-22 09:00:59,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:59,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:59,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504212574] [2019-10-22 09:00:59,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:59,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:59,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:59,488 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-10-22 09:00:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:59,664 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-10-22 09:00:59,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:59,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-22 09:00:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:59,672 INFO L225 Difference]: With dead ends: 2398 [2019-10-22 09:00:59,672 INFO L226 Difference]: Without dead ends: 1256 [2019-10-22 09:00:59,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-10-22 09:00:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-10-22 09:00:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-10-22 09:00:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-10-22 09:00:59,704 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-10-22 09:00:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:59,704 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-10-22 09:00:59,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-10-22 09:00:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-22 09:00:59,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:59,709 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:59,709 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:59,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1116608197, now seen corresponding path program 1 times [2019-10-22 09:00:59,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536417339] [2019-10-22 09:00:59,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-10-22 09:00:59,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536417339] [2019-10-22 09:00:59,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:59,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:59,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801071199] [2019-10-22 09:00:59,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:59,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:59,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:59,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:59,804 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-10-22 09:00:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:59,844 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-10-22 09:00:59,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:59,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-22 09:00:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:59,852 INFO L225 Difference]: With dead ends: 3630 [2019-10-22 09:00:59,852 INFO L226 Difference]: Without dead ends: 2422 [2019-10-22 09:00:59,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-10-22 09:00:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-10-22 09:00:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-10-22 09:00:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-10-22 09:00:59,910 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-10-22 09:00:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:59,911 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-10-22 09:00:59,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-10-22 09:00:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-22 09:00:59,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:59,918 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:59,918 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:59,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1235049671, now seen corresponding path program 1 times [2019-10-22 09:00:59,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565277032] [2019-10-22 09:00:59,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-22 09:01:00,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565277032] [2019-10-22 09:01:00,002 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:00,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:00,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105949175] [2019-10-22 09:01:00,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:00,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:00,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:00,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:00,004 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-10-22 09:01:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:00,179 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-10-22 09:01:00,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:00,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-22 09:01:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:00,188 INFO L225 Difference]: With dead ends: 5143 [2019-10-22 09:01:00,188 INFO L226 Difference]: Without dead ends: 2702 [2019-10-22 09:01:00,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-10-22 09:01:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-10-22 09:01:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-10-22 09:01:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-10-22 09:01:00,296 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-10-22 09:01:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:00,296 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-10-22 09:01:00,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-10-22 09:01:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-22 09:01:00,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:00,304 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:00,304 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:00,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2135776069, now seen corresponding path program 1 times [2019-10-22 09:01:00,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:00,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686629301] [2019-10-22 09:01:00,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-10-22 09:01:00,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686629301] [2019-10-22 09:01:00,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:00,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:00,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561948729] [2019-10-22 09:01:00,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:00,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:00,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:00,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:00,401 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-10-22 09:01:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:00,586 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-10-22 09:01:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:00,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-22 09:01:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:00,595 INFO L225 Difference]: With dead ends: 5335 [2019-10-22 09:01:00,595 INFO L226 Difference]: Without dead ends: 2696 [2019-10-22 09:01:00,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-10-22 09:01:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-10-22 09:01:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-10-22 09:01:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-10-22 09:01:00,664 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-10-22 09:01:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:00,664 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-10-22 09:01:00,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-10-22 09:01:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-22 09:01:00,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:00,671 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:00,672 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash -901475869, now seen corresponding path program 1 times [2019-10-22 09:01:00,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:00,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770654871] [2019-10-22 09:01:00,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-22 09:01:00,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770654871] [2019-10-22 09:01:00,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:00,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:00,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223942661] [2019-10-22 09:01:00,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:00,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:00,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:00,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:00,767 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-10-22 09:01:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:00,939 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-10-22 09:01:00,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:00,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-10-22 09:01:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:00,949 INFO L225 Difference]: With dead ends: 5299 [2019-10-22 09:01:00,949 INFO L226 Difference]: Without dead ends: 2684 [2019-10-22 09:01:00,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-10-22 09:01:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-10-22 09:01:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-10-22 09:01:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-10-22 09:01:01,030 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 307 [2019-10-22 09:01:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:01,031 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-10-22 09:01:01,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-10-22 09:01:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-22 09:01:01,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:01,040 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:01,041 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:01,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,041 INFO L82 PathProgramCache]: Analyzing trace with hash 503398906, now seen corresponding path program 1 times [2019-10-22 09:01:01,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876617977] [2019-10-22 09:01:01,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:01:01,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876617977] [2019-10-22 09:01:01,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:01,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:01,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067872790] [2019-10-22 09:01:01,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:01,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:01,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:01,175 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-10-22 09:01:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:01,336 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-10-22 09:01:01,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:01,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-10-22 09:01:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:01,346 INFO L225 Difference]: With dead ends: 5545 [2019-10-22 09:01:01,346 INFO L226 Difference]: Without dead ends: 2930 [2019-10-22 09:01:01,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-10-22 09:01:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-10-22 09:01:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-10-22 09:01:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-10-22 09:01:01,415 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-10-22 09:01:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:01,416 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-10-22 09:01:01,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-10-22 09:01:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-22 09:01:01,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:01,424 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:01,424 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:01,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,424 INFO L82 PathProgramCache]: Analyzing trace with hash -121520003, now seen corresponding path program 1 times [2019-10-22 09:01:01,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547275429] [2019-10-22 09:01:01,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-10-22 09:01:01,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547275429] [2019-10-22 09:01:01,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:01,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:01,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427434133] [2019-10-22 09:01:01,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:01,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:01,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:01,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:01,559 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-10-22 09:01:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:01,628 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-10-22 09:01:01,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:01,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-10-22 09:01:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:01,648 INFO L225 Difference]: With dead ends: 7734 [2019-10-22 09:01:01,652 INFO L226 Difference]: Without dead ends: 5029 [2019-10-22 09:01:01,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-10-22 09:01:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-10-22 09:01:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-10-22 09:01:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-10-22 09:01:01,807 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-10-22 09:01:01,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:01,808 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-10-22 09:01:01,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-10-22 09:01:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-10-22 09:01:01,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:01,819 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:01,819 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:01,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1651416633, now seen corresponding path program 1 times [2019-10-22 09:01:01,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301615087] [2019-10-22 09:01:01,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-22 09:01:01,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301615087] [2019-10-22 09:01:01,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197635466] [2019-10-22 09:01:01,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/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 09:01:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:02,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:02,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-22 09:01:02,209 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:02,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:01:02,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488455015] [2019-10-22 09:01:02,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:02,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:02,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:02,211 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-10-22 09:01:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:02,588 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-10-22 09:01:02,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:02,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2019-10-22 09:01:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:02,606 INFO L225 Difference]: With dead ends: 9987 [2019-10-22 09:01:02,606 INFO L226 Difference]: Without dead ends: 7540 [2019-10-22 09:01:02,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 348 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 09:01:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-10-22 09:01:02,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-10-22 09:01:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-10-22 09:01:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-10-22 09:01:02,782 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 346 [2019-10-22 09:01:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:02,783 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-10-22 09:01:02,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-10-22 09:01:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-10-22 09:01:02,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:02,794 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:02,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:02,995 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1397611342, now seen corresponding path program 1 times [2019-10-22 09:01:02,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786210305] [2019-10-22 09:01:02,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:03,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:01:03,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786210305] [2019-10-22 09:01:03,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466408700] [2019-10-22 09:01:03,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/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 09:01:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:03,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:03,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:01:03,494 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:03,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:01:03,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837231177] [2019-10-22 09:01:03,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:03,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:03,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:03,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:03,498 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-10-22 09:01:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:03,839 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-10-22 09:01:03,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:03,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-10-22 09:01:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:03,852 INFO L225 Difference]: With dead ends: 12544 [2019-10-22 09:01:03,852 INFO L226 Difference]: Without dead ends: 6979 [2019-10-22 09:01:03,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 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 09:01:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-10-22 09:01:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-10-22 09:01:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-10-22 09:01:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-10-22 09:01:03,996 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-10-22 09:01:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:03,997 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-10-22 09:01:03,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-10-22 09:01:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-10-22 09:01:04,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:04,009 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:04,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:04,210 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash -236946382, now seen corresponding path program 1 times [2019-10-22 09:01:04,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:04,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757856068] [2019-10-22 09:01:04,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-22 09:01:04,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757856068] [2019-10-22 09:01:04,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:04,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:04,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439694941] [2019-10-22 09:01:04,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:04,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:04,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:04,409 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-10-22 09:01:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:04,599 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-10-22 09:01:04,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:04,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-10-22 09:01:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:04,605 INFO L225 Difference]: With dead ends: 11015 [2019-10-22 09:01:04,605 INFO L226 Difference]: Without dead ends: 3069 [2019-10-22 09:01:04,612 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-10-22 09:01:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-10-22 09:01:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-10-22 09:01:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-10-22 09:01:04,671 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-10-22 09:01:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:04,671 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-10-22 09:01:04,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-10-22 09:01:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-10-22 09:01:04,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:04,682 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:04,682 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:04,683 INFO L82 PathProgramCache]: Analyzing trace with hash -788979008, now seen corresponding path program 1 times [2019-10-22 09:01:04,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:04,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909348475] [2019-10-22 09:01:04,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-10-22 09:01:04,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909348475] [2019-10-22 09:01:04,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81768288] [2019-10-22 09:01:04,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/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 09:01:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:04,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:04,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-10-22 09:01:05,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:05,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:05,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238501382] [2019-10-22 09:01:05,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:05,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:05,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:05,330 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-10-22 09:01:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:05,358 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-10-22 09:01:05,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:05,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-10-22 09:01:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:05,363 INFO L225 Difference]: With dead ends: 3028 [2019-10-22 09:01:05,363 INFO L226 Difference]: Without dead ends: 2531 [2019-10-22 09:01:05,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-10-22 09:01:05,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-10-22 09:01:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-10-22 09:01:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-10-22 09:01:05,411 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 496 [2019-10-22 09:01:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:05,411 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-10-22 09:01:05,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-10-22 09:01:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-10-22 09:01:05,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:05,422 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:05,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:05,624 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash 866163585, now seen corresponding path program 1 times [2019-10-22 09:01:05,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:05,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439866047] [2019-10-22 09:01:05,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:05,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:05,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 1546 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2019-10-22 09:01:05,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439866047] [2019-10-22 09:01:05,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15130947] [2019-10-22 09:01:05,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/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 09:01:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:05,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:05,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2339 trivial. 0 not checked. [2019-10-22 09:01:06,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:06,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:06,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907887802] [2019-10-22 09:01:06,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:06,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:06,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:06,075 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-10-22 09:01:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:06,226 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-10-22 09:01:06,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:06,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-10-22 09:01:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:06,232 INFO L225 Difference]: With dead ends: 5060 [2019-10-22 09:01:06,232 INFO L226 Difference]: Without dead ends: 2589 [2019-10-22 09:01:06,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-10-22 09:01:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-10-22 09:01:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-10-22 09:01:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-10-22 09:01:06,280 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 497 [2019-10-22 09:01:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:06,281 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-10-22 09:01:06,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-10-22 09:01:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-10-22 09:01:06,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:06,288 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:06,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:06,489 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:06,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1604973917, now seen corresponding path program 2 times [2019-10-22 09:01:06,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:06,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212558080] [2019-10-22 09:01:06,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-10-22 09:01:06,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212558080] [2019-10-22 09:01:06,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946020287] [2019-10-22 09:01:06,729 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:06,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:01:06,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:06,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:06,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-10-22 09:01:07,159 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:07,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:01:07,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825065054] [2019-10-22 09:01:07,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:07,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:07,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:07,162 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-10-22 09:01:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:07,362 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-10-22 09:01:07,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:07,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 608 [2019-10-22 09:01:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:07,363 INFO L225 Difference]: With dead ends: 2848 [2019-10-22 09:01:07,363 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:01:07,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 610 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 09:01:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:01:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:01:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:01:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:01:07,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608 [2019-10-22 09:01:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:07,367 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:07,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:07,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:01:07,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:07,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:01:07,950 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-10-22 09:01:08,693 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-10-22 09:01:09,109 INFO L446 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2019-10-22 09:01:09,109 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2019-10-22 09:01:09,109 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2019-10-22 09:01:09,109 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2019-10-22 09:01:09,109 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2019-10-22 09:01:09,109 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (not .cse2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-10-22 09:01:09,109 INFO L439 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:09,110 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-10-22 09:01:09,110 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2019-10-22 09:01:09,110 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2019-10-22 09:01:09,110 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2019-10-22 09:01:09,110 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2019-10-22 09:01:09,110 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2019-10-22 09:01:09,110 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2019-10-22 09:01:09,110 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2019-10-22 09:01:09,110 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-22 09:01:09,110 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2019-10-22 09:01:09,111 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2019-10-22 09:01:09,111 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2019-10-22 09:01:09,111 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2019-10-22 09:01:09,111 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2019-10-22 09:01:09,112 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-10-22 09:01:09,112 INFO L439 ceAbstractionStarter]: At program point L172(lines 162 527) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:09,112 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2019-10-22 09:01:09,112 INFO L443 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2019-10-22 09:01:09,112 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-10-22 09:01:09,112 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-10-22 09:01:09,112 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2019-10-22 09:01:09,112 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2019-10-22 09:01:09,112 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2019-10-22 09:01:09,112 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 85 575) no Hoare annotation was computed. [2019-10-22 09:01:09,112 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2019-10-22 09:01:09,113 INFO L446 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2019-10-22 09:01:09,113 INFO L439 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-10-22 09:01:09,113 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-22 09:01:09,113 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2019-10-22 09:01:09,113 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2019-10-22 09:01:09,113 INFO L446 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2019-10-22 09:01:09,113 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2019-10-22 09:01:09,113 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2019-10-22 09:01:09,113 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2019-10-22 09:01:09,113 INFO L446 ceAbstractionStarter]: At program point L574(lines 11 576) the Hoare annotation is: true [2019-10-22 09:01:09,113 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2019-10-22 09:01:09,114 INFO L443 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2019-10-22 09:01:09,114 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:09,114 INFO L439 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:09,114 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2019-10-22 09:01:09,114 INFO L439 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (not .cse4)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse10 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse0 .cse7 .cse4) (and .cse8 .cse4 .cse5 .cse9) (and .cse6 .cse10 .cse11 .cse0) (and .cse12 .cse8 .cse4 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse12 .cse0) (and .cse10 .cse11 .cse3 .cse4 .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and .cse0 .cse4 .cse9) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse8 .cse4) (and .cse7 .cse5)))) [2019-10-22 09:01:09,114 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2019-10-22 09:01:09,114 INFO L439 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: false [2019-10-22 09:01:09,115 INFO L443 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2019-10-22 09:01:09,115 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2019-10-22 09:01:09,115 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2019-10-22 09:01:09,115 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2019-10-22 09:01:09,116 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2019-10-22 09:01:09,116 INFO L439 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-10-22 09:01:09,116 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2019-10-22 09:01:09,116 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2019-10-22 09:01:09,116 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-10-22 09:01:09,116 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-10-22 09:01:09,116 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2019-10-22 09:01:09,116 INFO L443 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2019-10-22 09:01:09,116 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2019-10-22 09:01:09,116 INFO L439 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2019-10-22 09:01:09,117 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2019-10-22 09:01:09,118 INFO L439 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:09,118 INFO L443 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2019-10-22 09:01:09,118 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-10-22 09:01:09,118 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2019-10-22 09:01:09,118 INFO L446 ceAbstractionStarter]: At program point L585(lines 577 587) the Hoare annotation is: true [2019-10-22 09:01:09,118 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2019-10-22 09:01:09,118 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2019-10-22 09:01:09,118 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2019-10-22 09:01:09,118 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2019-10-22 09:01:09,118 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2019-10-22 09:01:09,120 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:01:09,121 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))))) [2019-10-22 09:01:09,121 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-10-22 09:01:09,121 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2019-10-22 09:01:09,121 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-10-22 09:01:09,121 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2019-10-22 09:01:09,121 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2019-10-22 09:01:09,121 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2019-10-22 09:01:09,121 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2019-10-22 09:01:09,121 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-10-22 09:01:09,121 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-10-22 09:01:09,121 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L439 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2019-10-22 09:01:09,122 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2019-10-22 09:01:09,123 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2019-10-22 09:01:09,123 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2019-10-22 09:01:09,123 INFO L443 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2019-10-22 09:01:09,123 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) .cse0))) [2019-10-22 09:01:09,123 INFO L439 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:09,123 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2019-10-22 09:01:09,123 INFO L443 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2019-10-22 09:01:09,124 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2019-10-22 09:01:09,124 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2019-10-22 09:01:09,124 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2019-10-22 09:01:09,124 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2019-10-22 09:01:09,124 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2019-10-22 09:01:09,124 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2019-10-22 09:01:09,124 INFO L443 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2019-10-22 09:01:09,124 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2019-10-22 09:01:09,125 INFO L443 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2019-10-22 09:01:09,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:09 BoogieIcfgContainer [2019-10-22 09:01:09,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:09,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:09,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:09,157 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:09,157 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:56" (3/4) ... [2019-10-22 09:01:09,161 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:01:09,180 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 09:01:09,183 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:01:09,292 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0f92304a-f239-47f8-a6ad-7fd4f3b0cf69/bin/uautomizer/witness.graphml [2019-10-22 09:01:09,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:09,296 INFO L168 Benchmark]: Toolchain (without parser) took 14144.31 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 943.7 MB). Free memory was 944.5 MB in the beginning and 1.5 GB in the end (delta: -594.6 MB). Peak memory consumption was 349.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:09,296 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:09,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:09,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:09,297 INFO L168 Benchmark]: Boogie Preprocessor took 31.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:09,297 INFO L168 Benchmark]: RCFGBuilder took 620.28 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:09,297 INFO L168 Benchmark]: TraceAbstraction took 12927.59 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 805.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -480.3 MB). Peak memory consumption was 325.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:09,298 INFO L168 Benchmark]: Witness Printer took 137.89 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:09,299 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 620.28 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12927.59 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 805.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -480.3 MB). Peak memory consumption was 325.5 MB. Max. memory is 11.5 GB. * Witness Printer took 137.89 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 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: - PositiveResult [Line: 573]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || (4512 <= s__state && s__state <= 4528 && blastFlag <= 2) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (s__state == 4384 && blastFlag <= 2)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && 4432 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 12.8s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 4490 SDtfs, 2114 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2400 GetRequests, 2365 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 427 HoareAnnotationTreeSize, 22 FomulaSimplifications, 29279 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24849 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 8415 NumberOfCodeBlocks, 8415 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 8385 ConstructedInterpolants, 0 QuantifiedInterpolants, 4385301 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3916 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 37271/37361 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 correct! Received shutdown request...