./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e02aecb828ddbcb4cc0dcb3053661f316d65cc9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:35:33,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:33,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:33,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:33,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:33,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:33,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:33,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:33,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:33,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:33,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:33,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:33,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:33,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:33,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:33,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:33,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:33,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:33,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:33,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:33,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:33,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:33,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:33,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:33,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:33,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:33,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:33,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:33,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:33,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:33,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:33,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:33,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:33,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:33,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:33,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:33,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:33,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:33,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:33,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:33,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:33,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:33,368 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:33,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:33,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:33,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:33,370 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:33,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:33,371 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:33,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:33,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:33,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:33,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:33,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:33,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:33,373 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:33,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:33,374 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:33,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:33,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:33,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:33,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:33,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:33,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:33,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:33,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:33,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:33,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:33,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:33,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:33,377 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e02aecb828ddbcb4cc0dcb3053661f316d65cc9 [2019-11-27 22:35:33,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:33,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:33,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:33,695 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:33,696 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:33,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c [2019-11-27 22:35:33,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ed5dc7a/9373867ecd374332883935b53ba23b38/FLAG2cf97c522 [2019-11-27 22:35:34,282 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:34,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c [2019-11-27 22:35:34,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ed5dc7a/9373867ecd374332883935b53ba23b38/FLAG2cf97c522 [2019-11-27 22:35:34,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ed5dc7a/9373867ecd374332883935b53ba23b38 [2019-11-27 22:35:34,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:34,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:34,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:34,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:34,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:34,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:34" (1/1) ... [2019-11-27 22:35:34,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c44cb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:34, skipping insertion in model container [2019-11-27 22:35:34,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:34" (1/1) ... [2019-11-27 22:35:34,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:34,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:34,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:34,965 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:35,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:35,113 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:35,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35 WrapperNode [2019-11-27 22:35:35,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:35,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:35,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:35,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:35,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:35,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:35,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:35,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:35,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:35,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:35,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:35,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:35,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:35,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:35,452 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:35,952 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-27 22:35:35,953 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-27 22:35:35,957 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:35,958 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:35,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:35 BoogieIcfgContainer [2019-11-27 22:35:35,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:35,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:35,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:35,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:35,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:34" (1/3) ... [2019-11-27 22:35:35,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8b707e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:35, skipping insertion in model container [2019-11-27 22:35:35,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (2/3) ... [2019-11-27 22:35:35,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8b707e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:35, skipping insertion in model container [2019-11-27 22:35:35,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:35" (3/3) ... [2019-11-27 22:35:35,969 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2019-11-27 22:35:35,980 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:35,987 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:36,000 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:36,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:36,038 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:36,038 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:36,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:36,039 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:36,039 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:36,039 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:36,039 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-27 22:35:36,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:36,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:36,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:36,078 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:36,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:36,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-27 22:35:36,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:36,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606300105] [2019-11-27 22:35:36,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:36,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606300105] [2019-11-27 22:35:36,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:36,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:36,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719197469] [2019-11-27 22:35:36,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:36,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:36,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,321 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-27 22:35:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,490 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-27 22:35:36,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:36,505 INFO L225 Difference]: With dead ends: 251 [2019-11-27 22:35:36,505 INFO L226 Difference]: Without dead ends: 114 [2019-11-27 22:35:36,509 INFO L630 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-11-27 22:35:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-27 22:35:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-27 22:35:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-27 22:35:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-27 22:35:36,556 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-27 22:35:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:36,557 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-27 22:35:36,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-27 22:35:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:35:36,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:36,561 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:36,561 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:36,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-27 22:35:36,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:36,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768576629] [2019-11-27 22:35:36,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:36,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768576629] [2019-11-27 22:35:36,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:36,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:36,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025260226] [2019-11-27 22:35:36,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:36,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:36,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:36,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,677 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-27 22:35:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,838 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-27 22:35:36,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 22:35:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:36,841 INFO L225 Difference]: With dead ends: 237 [2019-11-27 22:35:36,841 INFO L226 Difference]: Without dead ends: 132 [2019-11-27 22:35:36,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-27 22:35:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-27 22:35:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-27 22:35:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-27 22:35:36,864 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-27 22:35:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:36,864 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-27 22:35:36,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:36,865 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-27 22:35:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 22:35:36,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:36,869 INFO L410 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-11-27 22:35:36,869 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:36,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:36,870 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-27 22:35:36,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:36,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595214884] [2019-11-27 22:35:36,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:35:36,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595214884] [2019-11-27 22:35:36,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:36,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:36,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430233203] [2019-11-27 22:35:36,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:36,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:36,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,986 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-27 22:35:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,157 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-11-27 22:35:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-27 22:35:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,161 INFO L225 Difference]: With dead ends: 270 [2019-11-27 22:35:37,161 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 22:35:37,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 22:35:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-27 22:35:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 22:35:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-27 22:35:37,188 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-27 22:35:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,190 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-27 22:35:37,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-27 22:35:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:35:37,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,193 INFO L410 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-11-27 22:35:37,193 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1168366188, now seen corresponding path program 1 times [2019-11-27 22:35:37,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10291845] [2019-11-27 22:35:37,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:35:37,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10291845] [2019-11-27 22:35:37,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:37,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:37,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094636103] [2019-11-27 22:35:37,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,322 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-27 22:35:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,513 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-27 22:35:37,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:35:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,518 INFO L225 Difference]: With dead ends: 334 [2019-11-27 22:35:37,518 INFO L226 Difference]: Without dead ends: 196 [2019-11-27 22:35:37,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-27 22:35:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-27 22:35:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-27 22:35:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-27 22:35:37,532 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-27 22:35:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,533 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-27 22:35:37,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-27 22:35:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:35:37,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,536 INFO L410 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-11-27 22:35:37,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1321162774, now seen corresponding path program 1 times [2019-11-27 22:35:37,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117092923] [2019-11-27 22:35:37,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:35:37,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117092923] [2019-11-27 22:35:37,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:37,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:37,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952848402] [2019-11-27 22:35:37,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,594 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-27 22:35:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,735 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2019-11-27 22:35:37,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:35:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,738 INFO L225 Difference]: With dead ends: 390 [2019-11-27 22:35:37,738 INFO L226 Difference]: Without dead ends: 212 [2019-11-27 22:35:37,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-27 22:35:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2019-11-27 22:35:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-27 22:35:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-27 22:35:37,758 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-27 22:35:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,758 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-27 22:35:37,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-27 22:35:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:35:37,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,764 INFO L410 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-11-27 22:35:37,765 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,767 INFO L82 PathProgramCache]: Analyzing trace with hash -136835443, now seen corresponding path program 1 times [2019-11-27 22:35:37,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119819771] [2019-11-27 22:35:37,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:35:37,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119819771] [2019-11-27 22:35:37,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:37,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:37,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639237466] [2019-11-27 22:35:37,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,868 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-27 22:35:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,006 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-27 22:35:38,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:38,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:35:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,009 INFO L225 Difference]: With dead ends: 427 [2019-11-27 22:35:38,010 INFO L226 Difference]: Without dead ends: 230 [2019-11-27 22:35:38,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-27 22:35:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-27 22:35:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-27 22:35:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-27 22:35:38,021 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-27 22:35:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,022 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-27 22:35:38,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-27 22:35:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:35:38,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,025 INFO L410 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-11-27 22:35:38,025 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1324345659, now seen corresponding path program 1 times [2019-11-27 22:35:38,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010321612] [2019-11-27 22:35:38,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:35:38,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010321612] [2019-11-27 22:35:38,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:38,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:38,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112012724] [2019-11-27 22:35:38,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:38,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:38,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:38,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,100 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-27 22:35:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,183 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-27 22:35:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:38,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-27 22:35:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,187 INFO L225 Difference]: With dead ends: 661 [2019-11-27 22:35:38,188 INFO L226 Difference]: Without dead ends: 443 [2019-11-27 22:35:38,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-27 22:35:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-27 22:35:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-27 22:35:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-27 22:35:38,204 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-27 22:35:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,205 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-27 22:35:38,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-27 22:35:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-27 22:35:38,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,208 INFO L410 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-11-27 22:35:38,208 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash -606282988, now seen corresponding path program 1 times [2019-11-27 22:35:38,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418463573] [2019-11-27 22:35:38,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-27 22:35:38,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418463573] [2019-11-27 22:35:38,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:38,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:38,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986237881] [2019-11-27 22:35:38,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:38,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:38,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:38,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,265 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-27 22:35:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,310 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-27 22:35:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:38,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-27 22:35:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,315 INFO L225 Difference]: With dead ends: 661 [2019-11-27 22:35:38,315 INFO L226 Difference]: Without dead ends: 659 [2019-11-27 22:35:38,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-27 22:35:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-27 22:35:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-27 22:35:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-27 22:35:38,337 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-27 22:35:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,337 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-27 22:35:38,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-27 22:35:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-27 22:35:38,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,340 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:38,340 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1653094939, now seen corresponding path program 1 times [2019-11-27 22:35:38,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474130461] [2019-11-27 22:35:38,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-27 22:35:38,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474130461] [2019-11-27 22:35:38,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:38,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:38,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962629766] [2019-11-27 22:35:38,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:38,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:38,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:38,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,439 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-27 22:35:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,603 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-27 22:35:38,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:38,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-27 22:35:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,610 INFO L225 Difference]: With dead ends: 1462 [2019-11-27 22:35:38,610 INFO L226 Difference]: Without dead ends: 809 [2019-11-27 22:35:38,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-27 22:35:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-27 22:35:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-27 22:35:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-27 22:35:38,640 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 146 [2019-11-27 22:35:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,640 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-27 22:35:38,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-27 22:35:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-27 22:35:38,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,645 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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] [2019-11-27 22:35:38,645 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash 285230582, now seen corresponding path program 1 times [2019-11-27 22:35:38,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001019852] [2019-11-27 22:35:38,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-27 22:35:38,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001019852] [2019-11-27 22:35:38,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:38,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:38,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049144315] [2019-11-27 22:35:38,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:38,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:38,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,768 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-27 22:35:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,955 INFO L93 Difference]: Finished difference Result 1623 states and 2286 transitions. [2019-11-27 22:35:38,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:38,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-27 22:35:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,963 INFO L225 Difference]: With dead ends: 1623 [2019-11-27 22:35:38,964 INFO L226 Difference]: Without dead ends: 856 [2019-11-27 22:35:38,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-11-27 22:35:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 845. [2019-11-27 22:35:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-11-27 22:35:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1180 transitions. [2019-11-27 22:35:39,006 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1180 transitions. Word has length 182 [2019-11-27 22:35:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:39,007 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1180 transitions. [2019-11-27 22:35:39,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1180 transitions. [2019-11-27 22:35:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-27 22:35:39,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:39,015 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 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] [2019-11-27 22:35:39,015 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:39,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:39,016 INFO L82 PathProgramCache]: Analyzing trace with hash 742481215, now seen corresponding path program 1 times [2019-11-27 22:35:39,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:39,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252402724] [2019-11-27 22:35:39,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-27 22:35:39,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252402724] [2019-11-27 22:35:39,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:39,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:39,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456156849] [2019-11-27 22:35:39,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:39,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:39,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:39,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:39,146 INFO L87 Difference]: Start difference. First operand 845 states and 1180 transitions. Second operand 3 states. [2019-11-27 22:35:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:39,337 INFO L93 Difference]: Finished difference Result 1765 states and 2467 transitions. [2019-11-27 22:35:39,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:39,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-27 22:35:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:39,345 INFO L225 Difference]: With dead ends: 1765 [2019-11-27 22:35:39,346 INFO L226 Difference]: Without dead ends: 929 [2019-11-27 22:35:39,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-11-27 22:35:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 920. [2019-11-27 22:35:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-11-27 22:35:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1270 transitions. [2019-11-27 22:35:39,386 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1270 transitions. Word has length 203 [2019-11-27 22:35:39,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:39,387 INFO L462 AbstractCegarLoop]: Abstraction has 920 states and 1270 transitions. [2019-11-27 22:35:39,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1270 transitions. [2019-11-27 22:35:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-27 22:35:39,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:39,395 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2019-11-27 22:35:39,396 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash 884333740, now seen corresponding path program 1 times [2019-11-27 22:35:39,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:39,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530964640] [2019-11-27 22:35:39,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-11-27 22:35:39,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530964640] [2019-11-27 22:35:39,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:39,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:39,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174231540] [2019-11-27 22:35:39,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:39,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:39,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:39,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:39,574 INFO L87 Difference]: Start difference. First operand 920 states and 1270 transitions. Second operand 3 states. [2019-11-27 22:35:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:39,791 INFO L93 Difference]: Finished difference Result 1921 states and 2656 transitions. [2019-11-27 22:35:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:39,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-27 22:35:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:39,801 INFO L225 Difference]: With dead ends: 1921 [2019-11-27 22:35:39,801 INFO L226 Difference]: Without dead ends: 1010 [2019-11-27 22:35:39,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-11-27 22:35:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1004. [2019-11-27 22:35:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-11-27 22:35:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1369 transitions. [2019-11-27 22:35:39,850 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1369 transitions. Word has length 227 [2019-11-27 22:35:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:39,851 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1369 transitions. [2019-11-27 22:35:39,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1369 transitions. [2019-11-27 22:35:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-27 22:35:39,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:39,877 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2019-11-27 22:35:39,877 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:39,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1915374638, now seen corresponding path program 1 times [2019-11-27 22:35:39,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:39,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795586955] [2019-11-27 22:35:39,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-11-27 22:35:40,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795586955] [2019-11-27 22:35:40,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:40,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:40,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870609663] [2019-11-27 22:35:40,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:40,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:40,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:40,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:40,026 INFO L87 Difference]: Start difference. First operand 1004 states and 1369 transitions. Second operand 3 states. [2019-11-27 22:35:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:40,177 INFO L93 Difference]: Finished difference Result 2101 states and 2881 transitions. [2019-11-27 22:35:40,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:40,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-27 22:35:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:40,184 INFO L225 Difference]: With dead ends: 2101 [2019-11-27 22:35:40,184 INFO L226 Difference]: Without dead ends: 1106 [2019-11-27 22:35:40,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-11-27 22:35:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1097. [2019-11-27 22:35:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-11-27 22:35:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1477 transitions. [2019-11-27 22:35:40,220 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1477 transitions. Word has length 227 [2019-11-27 22:35:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:40,220 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 1477 transitions. [2019-11-27 22:35:40,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1477 transitions. [2019-11-27 22:35:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-27 22:35:40,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:40,228 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:40,229 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:40,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash -50346324, now seen corresponding path program 1 times [2019-11-27 22:35:40,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:40,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110234790] [2019-11-27 22:35:40,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-27 22:35:40,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110234790] [2019-11-27 22:35:40,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:40,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:40,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836088162] [2019-11-27 22:35:40,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:40,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:40,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:40,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:40,383 INFO L87 Difference]: Start difference. First operand 1097 states and 1477 transitions. Second operand 3 states. [2019-11-27 22:35:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:40,447 INFO L93 Difference]: Finished difference Result 3270 states and 4402 transitions. [2019-11-27 22:35:40,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:40,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-11-27 22:35:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:40,463 INFO L225 Difference]: With dead ends: 3270 [2019-11-27 22:35:40,463 INFO L226 Difference]: Without dead ends: 2182 [2019-11-27 22:35:40,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-11-27 22:35:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2180. [2019-11-27 22:35:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2180 states. [2019-11-27 22:35:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2934 transitions. [2019-11-27 22:35:40,553 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2934 transitions. Word has length 257 [2019-11-27 22:35:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:40,554 INFO L462 AbstractCegarLoop]: Abstraction has 2180 states and 2934 transitions. [2019-11-27 22:35:40,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2934 transitions. [2019-11-27 22:35:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-27 22:35:40,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:40,566 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:40,567 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash 980694574, now seen corresponding path program 1 times [2019-11-27 22:35:40,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:40,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603442047] [2019-11-27 22:35:40,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-27 22:35:40,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603442047] [2019-11-27 22:35:40,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:40,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:40,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150819072] [2019-11-27 22:35:40,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:40,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:40,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:40,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:40,738 INFO L87 Difference]: Start difference. First operand 2180 states and 2934 transitions. Second operand 3 states. [2019-11-27 22:35:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:40,971 INFO L93 Difference]: Finished difference Result 4576 states and 6206 transitions. [2019-11-27 22:35:40,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:40,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-11-27 22:35:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:40,989 INFO L225 Difference]: With dead ends: 4576 [2019-11-27 22:35:40,990 INFO L226 Difference]: Without dead ends: 2405 [2019-11-27 22:35:40,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-11-27 22:35:41,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2393. [2019-11-27 22:35:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-11-27 22:35:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3177 transitions. [2019-11-27 22:35:41,091 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3177 transitions. Word has length 257 [2019-11-27 22:35:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:41,092 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 3177 transitions. [2019-11-27 22:35:41,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3177 transitions. [2019-11-27 22:35:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-27 22:35:41,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:41,105 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 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] [2019-11-27 22:35:41,106 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:41,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1095007574, now seen corresponding path program 1 times [2019-11-27 22:35:41,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:41,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413856332] [2019-11-27 22:35:41,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-11-27 22:35:41,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413856332] [2019-11-27 22:35:41,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:41,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:41,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769341273] [2019-11-27 22:35:41,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:41,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:41,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:41,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:41,379 INFO L87 Difference]: Start difference. First operand 2393 states and 3177 transitions. Second operand 3 states. [2019-11-27 22:35:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:41,623 INFO L93 Difference]: Finished difference Result 4888 states and 6509 transitions. [2019-11-27 22:35:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:41,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-27 22:35:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:41,640 INFO L225 Difference]: With dead ends: 4888 [2019-11-27 22:35:41,641 INFO L226 Difference]: Without dead ends: 2504 [2019-11-27 22:35:41,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-11-27 22:35:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2492. [2019-11-27 22:35:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2492 states. [2019-11-27 22:35:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3291 transitions. [2019-11-27 22:35:41,736 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3291 transitions. Word has length 281 [2019-11-27 22:35:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:41,737 INFO L462 AbstractCegarLoop]: Abstraction has 2492 states and 3291 transitions. [2019-11-27 22:35:41,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3291 transitions. [2019-11-27 22:35:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-27 22:35:41,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:41,745 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:41,746 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:41,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1021889644, now seen corresponding path program 1 times [2019-11-27 22:35:41,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:41,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941501626] [2019-11-27 22:35:41,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-27 22:35:41,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941501626] [2019-11-27 22:35:41,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:41,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:41,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198733314] [2019-11-27 22:35:41,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:41,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:41,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:41,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:41,869 INFO L87 Difference]: Start difference. First operand 2492 states and 3291 transitions. Second operand 3 states. [2019-11-27 22:35:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:42,112 INFO L93 Difference]: Finished difference Result 5275 states and 7097 transitions. [2019-11-27 22:35:42,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:42,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-27 22:35:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:42,133 INFO L225 Difference]: With dead ends: 5275 [2019-11-27 22:35:42,134 INFO L226 Difference]: Without dead ends: 2792 [2019-11-27 22:35:42,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2019-11-27 22:35:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2732. [2019-11-27 22:35:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2019-11-27 22:35:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3573 transitions. [2019-11-27 22:35:42,248 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3573 transitions. Word has length 292 [2019-11-27 22:35:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:42,249 INFO L462 AbstractCegarLoop]: Abstraction has 2732 states and 3573 transitions. [2019-11-27 22:35:42,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3573 transitions. [2019-11-27 22:35:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-27 22:35:42,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:42,265 INFO L410 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:42,265 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash -229308938, now seen corresponding path program 1 times [2019-11-27 22:35:42,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:42,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213282012] [2019-11-27 22:35:42,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-27 22:35:42,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213282012] [2019-11-27 22:35:42,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:42,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:42,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494703507] [2019-11-27 22:35:42,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:42,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:42,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:42,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:42,442 INFO L87 Difference]: Start difference. First operand 2732 states and 3573 transitions. Second operand 3 states. [2019-11-27 22:35:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:42,647 INFO L93 Difference]: Finished difference Result 5539 states and 7235 transitions. [2019-11-27 22:35:42,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:42,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-27 22:35:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:42,663 INFO L225 Difference]: With dead ends: 5539 [2019-11-27 22:35:42,663 INFO L226 Difference]: Without dead ends: 2798 [2019-11-27 22:35:42,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2019-11-27 22:35:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2726. [2019-11-27 22:35:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2019-11-27 22:35:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3537 transitions. [2019-11-27 22:35:42,745 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3537 transitions. Word has length 300 [2019-11-27 22:35:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:42,746 INFO L462 AbstractCegarLoop]: Abstraction has 2726 states and 3537 transitions. [2019-11-27 22:35:42,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3537 transitions. [2019-11-27 22:35:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-27 22:35:42,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:42,757 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:42,758 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1736108088, now seen corresponding path program 1 times [2019-11-27 22:35:42,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:42,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885819046] [2019-11-27 22:35:42,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-27 22:35:43,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885819046] [2019-11-27 22:35:43,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125343549] [2019-11-27 22:35:43,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-27 22:35:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:43,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:43,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-27 22:35:43,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:35:43,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:35:43,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690402900] [2019-11-27 22:35:43,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:43,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:43,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:43,411 INFO L87 Difference]: Start difference. First operand 2726 states and 3537 transitions. Second operand 4 states. [2019-11-27 22:35:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:43,907 INFO L93 Difference]: Finished difference Result 8268 states and 10711 transitions. [2019-11-27 22:35:43,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:43,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-11-27 22:35:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:43,945 INFO L225 Difference]: With dead ends: 8268 [2019-11-27 22:35:43,946 INFO L226 Difference]: Without dead ends: 5545 [2019-11-27 22:35:43,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:43,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2019-11-27 22:35:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 3572. [2019-11-27 22:35:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-11-27 22:35:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4587 transitions. [2019-11-27 22:35:44,149 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4587 transitions. Word has length 331 [2019-11-27 22:35:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,150 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 4587 transitions. [2019-11-27 22:35:44,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4587 transitions. [2019-11-27 22:35:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-27 22:35:44,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,169 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:44,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:44,378 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash 619319881, now seen corresponding path program 1 times [2019-11-27 22:35:44,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458860008] [2019-11-27 22:35:44,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 770 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-11-27 22:35:44,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458860008] [2019-11-27 22:35:44,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:44,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006804755] [2019-11-27 22:35:44,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,692 INFO L87 Difference]: Start difference. First operand 3572 states and 4587 transitions. Second operand 3 states. [2019-11-27 22:35:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,860 INFO L93 Difference]: Finished difference Result 9456 states and 12199 transitions. [2019-11-27 22:35:44,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-27 22:35:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,923 INFO L225 Difference]: With dead ends: 9456 [2019-11-27 22:35:44,923 INFO L226 Difference]: Without dead ends: 5893 [2019-11-27 22:35:44,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2019-11-27 22:35:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 5591. [2019-11-27 22:35:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5591 states. [2019-11-27 22:35:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5591 states to 5591 states and 7204 transitions. [2019-11-27 22:35:45,211 INFO L78 Accepts]: Start accepts. Automaton has 5591 states and 7204 transitions. Word has length 332 [2019-11-27 22:35:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,212 INFO L462 AbstractCegarLoop]: Abstraction has 5591 states and 7204 transitions. [2019-11-27 22:35:45,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 5591 states and 7204 transitions. [2019-11-27 22:35:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-27 22:35:45,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,231 INFO L410 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:45,231 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash -319778261, now seen corresponding path program 1 times [2019-11-27 22:35:45,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365824913] [2019-11-27 22:35:45,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-27 22:35:45,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365824913] [2019-11-27 22:35:45,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:45,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408348180] [2019-11-27 22:35:45,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,496 INFO L87 Difference]: Start difference. First operand 5591 states and 7204 transitions. Second operand 3 states. [2019-11-27 22:35:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,829 INFO L93 Difference]: Finished difference Result 11779 states and 15109 transitions. [2019-11-27 22:35:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-11-27 22:35:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,844 INFO L225 Difference]: With dead ends: 11779 [2019-11-27 22:35:45,845 INFO L226 Difference]: Without dead ends: 6197 [2019-11-27 22:35:45,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2019-11-27 22:35:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 5765. [2019-11-27 22:35:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-11-27 22:35:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7438 transitions. [2019-11-27 22:35:46,019 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7438 transitions. Word has length 337 [2019-11-27 22:35:46,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,020 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 7438 transitions. [2019-11-27 22:35:46,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7438 transitions. [2019-11-27 22:35:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-27 22:35:46,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,035 INFO L410 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, 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-11-27 22:35:46,035 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1517002467, now seen corresponding path program 1 times [2019-11-27 22:35:46,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585474127] [2019-11-27 22:35:46,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-27 22:35:46,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585474127] [2019-11-27 22:35:46,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421275369] [2019-11-27 22:35:46,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-27 22:35:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:46,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-27 22:35:46,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:35:46,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:35:46,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667265165] [2019-11-27 22:35:46,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:46,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:46,702 INFO L87 Difference]: Start difference. First operand 5765 states and 7438 transitions. Second operand 4 states. [2019-11-27 22:35:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,275 INFO L93 Difference]: Finished difference Result 13053 states and 16776 transitions. [2019-11-27 22:35:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:47,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2019-11-27 22:35:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,304 INFO L225 Difference]: With dead ends: 13053 [2019-11-27 22:35:47,304 INFO L226 Difference]: Without dead ends: 7284 [2019-11-27 22:35:47,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7284 states. [2019-11-27 22:35:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7284 to 5912. [2019-11-27 22:35:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-11-27 22:35:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 7555 transitions. [2019-11-27 22:35:47,587 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 7555 transitions. Word has length 375 [2019-11-27 22:35:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,589 INFO L462 AbstractCegarLoop]: Abstraction has 5912 states and 7555 transitions. [2019-11-27 22:35:47,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 7555 transitions. [2019-11-27 22:35:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-11-27 22:35:47,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,624 INFO L410 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, 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] [2019-11-27 22:35:47,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:47,830 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,833 INFO L82 PathProgramCache]: Analyzing trace with hash 934852515, now seen corresponding path program 1 times [2019-11-27 22:35:47,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478580225] [2019-11-27 22:35:47,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-27 22:35:48,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478580225] [2019-11-27 22:35:48,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:48,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644545415] [2019-11-27 22:35:48,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,121 INFO L87 Difference]: Start difference. First operand 5912 states and 7555 transitions. Second operand 3 states. [2019-11-27 22:35:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,435 INFO L93 Difference]: Finished difference Result 11428 states and 14363 transitions. [2019-11-27 22:35:48,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2019-11-27 22:35:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,448 INFO L225 Difference]: With dead ends: 11428 [2019-11-27 22:35:48,448 INFO L226 Difference]: Without dead ends: 3254 [2019-11-27 22:35:48,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-11-27 22:35:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3162. [2019-11-27 22:35:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3162 states. [2019-11-27 22:35:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 3995 transitions. [2019-11-27 22:35:48,592 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 3995 transitions. Word has length 414 [2019-11-27 22:35:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,592 INFO L462 AbstractCegarLoop]: Abstraction has 3162 states and 3995 transitions. [2019-11-27 22:35:48,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 3995 transitions. [2019-11-27 22:35:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-11-27 22:35:48,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,618 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:48,618 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1275695783, now seen corresponding path program 1 times [2019-11-27 22:35:48,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204154003] [2019-11-27 22:35:48,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-11-27 22:35:49,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204154003] [2019-11-27 22:35:49,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906867331] [2019-11-27 22:35:49,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-27 22:35:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:49,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:49,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-11-27 22:35:49,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:35:49,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:35:49,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532838473] [2019-11-27 22:35:49,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:49,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:49,601 INFO L87 Difference]: Start difference. First operand 3162 states and 3995 transitions. Second operand 4 states. [2019-11-27 22:35:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:49,808 INFO L93 Difference]: Finished difference Result 3822 states and 4839 transitions. [2019-11-27 22:35:49,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:49,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 481 [2019-11-27 22:35:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:49,809 INFO L225 Difference]: With dead ends: 3822 [2019-11-27 22:35:49,809 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:35:49,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:35:49,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:35:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:35:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:35:49,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 481 [2019-11-27 22:35:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:49,816 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:35:49,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:35:49,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:35:50,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:50,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:35:50,659 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 84 [2019-11-27 22:35:51,518 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-11-27 22:35:51,624 INFO L242 CegarLoopResult]: At program point L168(lines 164 498) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-27 22:35:51,624 INFO L242 CegarLoopResult]: At program point L102(lines 101 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:35:51,624 INFO L246 CegarLoopResult]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-27 22:35:51,625 INFO L246 CegarLoopResult]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-27 22:35:51,625 INFO L246 CegarLoopResult]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-11-27 22:35:51,625 INFO L246 CegarLoopResult]: For program point L434-2(lines 434 438) no Hoare annotation was computed. [2019-11-27 22:35:51,625 INFO L246 CegarLoopResult]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-11-27 22:35:51,625 INFO L246 CegarLoopResult]: For program point L335-2(lines 335 339) no Hoare annotation was computed. [2019-11-27 22:35:51,625 INFO L246 CegarLoopResult]: For program point L170(lines 170 496) no Hoare annotation was computed. [2019-11-27 22:35:51,625 INFO L246 CegarLoopResult]: For program point L137(lines 137 507) no Hoare annotation was computed. [2019-11-27 22:35:51,625 INFO L246 CegarLoopResult]: For program point L104(lines 104 518) no Hoare annotation was computed. [2019-11-27 22:35:51,625 INFO L242 CegarLoopResult]: At program point L138(lines 134 508) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-27 22:35:51,625 INFO L246 CegarLoopResult]: For program point L304(lines 304 306) no Hoare annotation was computed. [2019-11-27 22:35:51,626 INFO L246 CegarLoopResult]: For program point L271(lines 271 275) no Hoare annotation was computed. [2019-11-27 22:35:51,626 INFO L246 CegarLoopResult]: For program point L238(lines 238 241) no Hoare annotation was computed. [2019-11-27 22:35:51,626 INFO L246 CegarLoopResult]: For program point L304-2(lines 201 484) no Hoare annotation was computed. [2019-11-27 22:35:51,626 INFO L246 CegarLoopResult]: For program point L271-2(lines 271 275) no Hoare annotation was computed. [2019-11-27 22:35:51,626 INFO L246 CegarLoopResult]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-27 22:35:51,626 INFO L246 CegarLoopResult]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-11-27 22:35:51,626 INFO L242 CegarLoopResult]: At program point L206(lines 104 518) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-27 22:35:51,626 INFO L246 CegarLoopResult]: For program point L173(lines 173 495) no Hoare annotation was computed. [2019-11-27 22:35:51,626 INFO L246 CegarLoopResult]: For program point L140(lines 140 506) no Hoare annotation was computed. [2019-11-27 22:35:51,626 INFO L246 CegarLoopResult]: For program point L107(lines 107 517) no Hoare annotation was computed. [2019-11-27 22:35:51,629 INFO L242 CegarLoopResult]: At program point L174(lines 170 496) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-27 22:35:51,629 INFO L246 CegarLoopResult]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-11-27 22:35:51,630 INFO L246 CegarLoopResult]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2019-11-27 22:35:51,630 INFO L249 CegarLoopResult]: At program point L539(lines 97 540) the Hoare annotation is: true [2019-11-27 22:35:51,630 INFO L246 CegarLoopResult]: For program point L176(lines 176 494) no Hoare annotation was computed. [2019-11-27 22:35:51,630 INFO L246 CegarLoopResult]: For program point L143(lines 143 505) no Hoare annotation was computed. [2019-11-27 22:35:51,630 INFO L246 CegarLoopResult]: For program point L110(lines 110 516) no Hoare annotation was computed. [2019-11-27 22:35:51,631 INFO L242 CegarLoopResult]: At program point L144(lines 140 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-27 22:35:51,631 INFO L246 CegarLoopResult]: For program point L211(lines 211 213) no Hoare annotation was computed. [2019-11-27 22:35:51,631 INFO L246 CegarLoopResult]: For program point L211-2(lines 211 213) no Hoare annotation was computed. [2019-11-27 22:35:51,631 INFO L246 CegarLoopResult]: For program point L179(lines 179 493) no Hoare annotation was computed. [2019-11-27 22:35:51,631 INFO L246 CegarLoopResult]: For program point L146(lines 146 504) no Hoare annotation was computed. [2019-11-27 22:35:51,632 INFO L246 CegarLoopResult]: For program point L113(lines 113 515) no Hoare annotation was computed. [2019-11-27 22:35:51,632 INFO L246 CegarLoopResult]: For program point L477(lines 477 479) no Hoare annotation was computed. [2019-11-27 22:35:51,632 INFO L246 CegarLoopResult]: For program point L444(lines 444 455) no Hoare annotation was computed. [2019-11-27 22:35:51,633 INFO L246 CegarLoopResult]: For program point L411(lines 411 425) no Hoare annotation was computed. [2019-11-27 22:35:51,633 INFO L246 CegarLoopResult]: For program point L411-1(lines 411 425) no Hoare annotation was computed. [2019-11-27 22:35:51,633 INFO L246 CegarLoopResult]: For program point L444-2(lines 444 455) no Hoare annotation was computed. [2019-11-27 22:35:51,634 INFO L246 CegarLoopResult]: For program point L312(lines 312 315) no Hoare annotation was computed. [2019-11-27 22:35:51,634 INFO L242 CegarLoopResult]: At program point L180(lines 176 494) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-27 22:35:51,634 INFO L246 CegarLoopResult]: For program point L544(lines 544 546) no Hoare annotation was computed. [2019-11-27 22:35:51,634 INFO L246 CegarLoopResult]: For program point L544-2(lines 544 546) no Hoare annotation was computed. [2019-11-27 22:35:51,635 INFO L246 CegarLoopResult]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-11-27 22:35:51,635 INFO L246 CegarLoopResult]: For program point L182(lines 182 492) no Hoare annotation was computed. [2019-11-27 22:35:51,635 INFO L246 CegarLoopResult]: For program point L149(lines 149 503) no Hoare annotation was computed. [2019-11-27 22:35:51,635 INFO L246 CegarLoopResult]: For program point L116(lines 116 514) no Hoare annotation was computed. [2019-11-27 22:35:51,635 INFO L246 CegarLoopResult]: For program point L381(lines 381 383) no Hoare annotation was computed. [2019-11-27 22:35:51,635 INFO L246 CegarLoopResult]: For program point L282(lines 282 296) no Hoare annotation was computed. [2019-11-27 22:35:51,636 INFO L246 CegarLoopResult]: For program point L216(lines 216 219) no Hoare annotation was computed. [2019-11-27 22:35:51,636 INFO L246 CegarLoopResult]: For program point L282-2(lines 282 296) no Hoare annotation was computed. [2019-11-27 22:35:51,636 INFO L242 CegarLoopResult]: At program point L150(lines 146 504) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-27 22:35:51,636 INFO L246 CegarLoopResult]: For program point L84(lines 84 90) no Hoare annotation was computed. [2019-11-27 22:35:51,636 INFO L246 CegarLoopResult]: For program point L415(lines 415 421) no Hoare annotation was computed. [2019-11-27 22:35:51,637 INFO L246 CegarLoopResult]: For program point L250(lines 250 252) no Hoare annotation was computed. [2019-11-27 22:35:51,637 INFO L246 CegarLoopResult]: For program point L250-2(lines 201 484) no Hoare annotation was computed. [2019-11-27 22:35:51,637 INFO L246 CegarLoopResult]: For program point L449(lines 449 452) no Hoare annotation was computed. [2019-11-27 22:35:51,637 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:35:51,637 INFO L246 CegarLoopResult]: For program point L185(lines 185 491) no Hoare annotation was computed. [2019-11-27 22:35:51,637 INFO L246 CegarLoopResult]: For program point L152(lines 152 502) no Hoare annotation was computed. [2019-11-27 22:35:51,638 INFO L246 CegarLoopResult]: For program point L119(lines 119 513) no Hoare annotation was computed. [2019-11-27 22:35:51,638 INFO L249 CegarLoopResult]: At program point L549(lines 10 551) the Hoare annotation is: true [2019-11-27 22:35:51,638 INFO L242 CegarLoopResult]: At program point L186(lines 182 492) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2019-11-27 22:35:51,638 INFO L242 CegarLoopResult]: At program point L120(lines 116 514) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:35:51,638 INFO L246 CegarLoopResult]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-27 22:35:51,639 INFO L246 CegarLoopResult]: For program point L87-2(lines 84 90) no Hoare annotation was computed. [2019-11-27 22:35:51,639 INFO L246 CegarLoopResult]: For program point L286(lines 286 292) no Hoare annotation was computed. [2019-11-27 22:35:51,639 INFO L242 CegarLoopResult]: At program point L485(lines 98 538) the Hoare annotation is: (let ((.cse7 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse9 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse5 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse6) (and .cse8 .cse7 .cse6 .cse9) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse8 .cse0 .cse9) (and .cse0 .cse1 .cse6) (and .cse0 .cse6 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse10 .cse11 .cse5 .cse6 .cse2) (and .cse3 .cse4 .cse0) (and .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11))) [2019-11-27 22:35:51,639 INFO L246 CegarLoopResult]: For program point L320(lines 320 322) no Hoare annotation was computed. [2019-11-27 22:35:51,640 INFO L246 CegarLoopResult]: For program point L188(lines 188 490) no Hoare annotation was computed. [2019-11-27 22:35:51,640 INFO L246 CegarLoopResult]: For program point L155(lines 155 501) no Hoare annotation was computed. [2019-11-27 22:35:51,640 INFO L246 CegarLoopResult]: For program point L122(lines 122 512) no Hoare annotation was computed. [2019-11-27 22:35:51,640 INFO L246 CegarLoopResult]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-11-27 22:35:51,640 INFO L242 CegarLoopResult]: At program point L321(lines 75 550) the Hoare annotation is: false [2019-11-27 22:35:51,640 INFO L246 CegarLoopResult]: For program point L387-2(lines 201 484) no Hoare annotation was computed. [2019-11-27 22:35:51,641 INFO L246 CegarLoopResult]: For program point L222(lines 222 233) no Hoare annotation was computed. [2019-11-27 22:35:51,641 INFO L246 CegarLoopResult]: For program point L222-2(lines 201 484) no Hoare annotation was computed. [2019-11-27 22:35:51,641 INFO L246 CegarLoopResult]: For program point L520(lines 520 536) no Hoare annotation was computed. [2019-11-27 22:35:51,641 INFO L246 CegarLoopResult]: For program point L289(lines 289 291) no Hoare annotation was computed. [2019-11-27 22:35:51,641 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:35:51,641 INFO L246 CegarLoopResult]: For program point L289-2(lines 284 296) no Hoare annotation was computed. [2019-11-27 22:35:51,642 INFO L246 CegarLoopResult]: For program point L521(lines 521 535) no Hoare annotation was computed. [2019-11-27 22:35:51,642 INFO L246 CegarLoopResult]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-27 22:35:51,642 INFO L246 CegarLoopResult]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-27 22:35:51,643 INFO L246 CegarLoopResult]: For program point L224(lines 224 227) no Hoare annotation was computed. [2019-11-27 22:35:51,643 INFO L246 CegarLoopResult]: For program point L191(lines 191 489) no Hoare annotation was computed. [2019-11-27 22:35:51,643 INFO L246 CegarLoopResult]: For program point L158(lines 158 500) no Hoare annotation was computed. [2019-11-27 22:35:51,643 INFO L246 CegarLoopResult]: For program point L125(lines 125 511) no Hoare annotation was computed. [2019-11-27 22:35:51,644 INFO L246 CegarLoopResult]: For program point L92(lines 92 96) no Hoare annotation was computed. [2019-11-27 22:35:51,644 INFO L246 CegarLoopResult]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-11-27 22:35:51,644 INFO L246 CegarLoopResult]: For program point L522-2(lines 521 535) no Hoare annotation was computed. [2019-11-27 22:35:51,644 INFO L246 CegarLoopResult]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-27 22:35:51,644 INFO L242 CegarLoopResult]: At program point L192(lines 188 490) the Hoare annotation is: (let ((.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) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-27 22:35:51,645 INFO L242 CegarLoopResult]: At program point L126(lines 122 512) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:35:51,645 INFO L246 CegarLoopResult]: For program point L93(lines 93 95) no Hoare annotation was computed. [2019-11-27 22:35:51,645 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:35:51,645 INFO L246 CegarLoopResult]: For program point L524(lines 524 526) no Hoare annotation was computed. [2019-11-27 22:35:51,645 INFO L246 CegarLoopResult]: For program point L194(lines 194 488) no Hoare annotation was computed. [2019-11-27 22:35:51,645 INFO L246 CegarLoopResult]: For program point L161(lines 161 499) no Hoare annotation was computed. [2019-11-27 22:35:51,646 INFO L246 CegarLoopResult]: For program point L128(lines 128 510) no Hoare annotation was computed. [2019-11-27 22:35:51,646 INFO L246 CegarLoopResult]: For program point L360(lines 360 365) no Hoare annotation was computed. [2019-11-27 22:35:51,646 INFO L246 CegarLoopResult]: For program point L360-2(lines 360 365) no Hoare annotation was computed. [2019-11-27 22:35:51,646 INFO L246 CegarLoopResult]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-11-27 22:35:51,646 INFO L242 CegarLoopResult]: At program point L195(lines 194 488) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1))) [2019-11-27 22:35:51,647 INFO L242 CegarLoopResult]: At program point L162(lines 152 502) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-27 22:35:51,648 INFO L246 CegarLoopResult]: For program point L460-1(lines 460 462) no Hoare annotation was computed. [2019-11-27 22:35:51,648 INFO L249 CegarLoopResult]: At program point L560(lines 552 562) the Hoare annotation is: true [2019-11-27 22:35:51,648 INFO L246 CegarLoopResult]: For program point L197(lines 197 487) no Hoare annotation was computed. [2019-11-27 22:35:51,648 INFO L246 CegarLoopResult]: For program point L164(lines 164 498) no Hoare annotation was computed. [2019-11-27 22:35:51,649 INFO L246 CegarLoopResult]: For program point L131(lines 131 509) no Hoare annotation was computed. [2019-11-27 22:35:51,649 INFO L246 CegarLoopResult]: For program point L98-1(lines 75 550) no Hoare annotation was computed. [2019-11-27 22:35:51,649 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-11-27 22:35:51,649 INFO L246 CegarLoopResult]: For program point L396(lines 396 399) no Hoare annotation was computed. [2019-11-27 22:35:51,649 INFO L249 CegarLoopResult]: At program point L198(lines 197 487) the Hoare annotation is: true [2019-11-27 22:35:51,650 INFO L242 CegarLoopResult]: At program point L132(lines 128 510) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-27 22:35:51,650 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-27 22:35:51,650 INFO L246 CegarLoopResult]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-11-27 22:35:51,650 INFO L246 CegarLoopResult]: For program point L265(lines 265 267) no Hoare annotation was computed. [2019-11-27 22:35:51,650 INFO L246 CegarLoopResult]: For program point L265-2(lines 201 484) no Hoare annotation was computed. [2019-11-27 22:35:51,650 INFO L246 CegarLoopResult]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-27 22:35:51,651 INFO L246 CegarLoopResult]: For program point L332(lines 332 334) no Hoare annotation was computed. [2019-11-27 22:35:51,651 INFO L249 CegarLoopResult]: At program point L200(lines 199 487) the Hoare annotation is: true [2019-11-27 22:35:51,651 INFO L246 CegarLoopResult]: For program point L167(lines 167 497) no Hoare annotation was computed. [2019-11-27 22:35:51,651 INFO L246 CegarLoopResult]: For program point L134(lines 134 508) no Hoare annotation was computed. [2019-11-27 22:35:51,651 INFO L246 CegarLoopResult]: For program point L101(lines 101 519) no Hoare annotation was computed. [2019-11-27 22:35:51,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:51 BoogieIcfgContainer [2019-11-27 22:35:51,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:51,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:51,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:51,690 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:51,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:35" (3/4) ... [2019-11-27 22:35:51,698 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:35:51,720 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:35:51,723 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:35:51,915 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:51,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:51,918 INFO L168 Benchmark]: Toolchain (without parser) took 17313.07 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 651.2 MB). Free memory was 952.3 MB in the beginning and 934.8 MB in the end (delta: 17.5 MB). Peak memory consumption was 668.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:51,919 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:51,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:51,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:51,920 INFO L168 Benchmark]: Boogie Preprocessor took 33.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:51,920 INFO L168 Benchmark]: RCFGBuilder took 742.08 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: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:51,921 INFO L168 Benchmark]: TraceAbstraction took 15728.66 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 509.6 MB). Free memory was 1.1 GB in the beginning and 934.8 MB in the end (delta: 133.0 MB). Peak memory consumption was 642.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:51,922 INFO L168 Benchmark]: Witness Printer took 226.37 ms. Allocated memory is still 1.7 GB. Free memory was 934.8 MB in the beginning and 934.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-27 22:35:51,925 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 507.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.96 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 33.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 742.08 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: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15728.66 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 509.6 MB). Free memory was 1.1 GB in the beginning and 934.8 MB in the end (delta: 133.0 MB). Peak memory consumption was 642.6 MB. Max. memory is 11.5 GB. * Witness Printer took 226.37 ms. Allocated memory is still 1.7 GB. Free memory was 934.8 MB in the beginning and 934.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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: 182]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || ((s__state <= 4560 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 4) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 188]: 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) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && 4368 == s__state) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == 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)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 13.9s, OverallIterations: 24, TraceHistogramMax: 18, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 4515 SDtfs, 1551 SDslu, 2498 SDs, 0 SdLazy, 2467 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1264 GetRequests, 1234 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5912occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 4422 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 177 NumberOfFragments, 434 HoareAnnotationTreeSize, 22 FomulaSimplifications, 10346 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1463 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 6366 NumberOfCodeBlocks, 6366 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6339 ConstructedInterpolants, 0 QuantifiedInterpolants, 2477651 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2052 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 23271/23337 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...