./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.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_2.cil-2.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 d33dcc608b21d2bdbfa0a947775d4e23b857cf07 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:30,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:30,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:30,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:30,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:30,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:30,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:30,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:30,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:30,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:30,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:30,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:30,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:30,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:30,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:30,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:30,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:30,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:30,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:30,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:30,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:30,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:30,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:30,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:30,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:30,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:30,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:30,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:30,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:30,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:30,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:30,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:30,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:30,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:30,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:30,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:30,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:30,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:30,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:30,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:30,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:30,382 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:30,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:30,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:30,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:30,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:30,399 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:30,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:30,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:30,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:30,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:30,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:30,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:30,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:30,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:30,401 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:30,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:30,402 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:30,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:30,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:30,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:30,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:30,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:30,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:30,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:30,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:30,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:30,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:30,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:30,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:30,406 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 -> d33dcc608b21d2bdbfa0a947775d4e23b857cf07 [2019-11-27 22:35:30,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:30,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:30,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:30,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:30,757 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:30,758 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-27 22:35:30,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4637088/3b572453676f4e27845337392c12aa8b/FLAG7952ed083 [2019-11-27 22:35:31,381 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:31,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-27 22:35:31,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4637088/3b572453676f4e27845337392c12aa8b/FLAG7952ed083 [2019-11-27 22:35:31,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4637088/3b572453676f4e27845337392c12aa8b [2019-11-27 22:35:31,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:31,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:31,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:31,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:31,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:31,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:31" (1/1) ... [2019-11-27 22:35:31,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e727e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:31, skipping insertion in model container [2019-11-27 22:35:31,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:31" (1/1) ... [2019-11-27 22:35:31,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:31,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:32,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:32,006 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:32,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:32,168 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:32,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:32 WrapperNode [2019-11-27 22:35:32,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:32,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:32,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:32,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:32,177 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:32" (1/1) ... [2019-11-27 22:35:32,187 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:32" (1/1) ... [2019-11-27 22:35:32,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:32,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:32,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:32,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:32,243 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:32" (1/1) ... [2019-11-27 22:35:32,244 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:32" (1/1) ... [2019-11-27 22:35:32,259 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:32" (1/1) ... [2019-11-27 22:35:32,260 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:32" (1/1) ... [2019-11-27 22:35:32,269 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:32" (1/1) ... [2019-11-27 22:35:32,279 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:32" (1/1) ... [2019-11-27 22:35:32,282 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:32" (1/1) ... [2019-11-27 22:35:32,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:32,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:32,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:32,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:32,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:32" (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:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:32,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:32,466 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:33,142 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-27 22:35:33,142 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-27 22:35:33,147 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:33,147 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:33,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:33 BoogieIcfgContainer [2019-11-27 22:35:33,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:33,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:33,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:33,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:33,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:31" (1/3) ... [2019-11-27 22:35:33,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ae6540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:33, skipping insertion in model container [2019-11-27 22:35:33,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:32" (2/3) ... [2019-11-27 22:35:33,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ae6540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:33, skipping insertion in model container [2019-11-27 22:35:33,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:33" (3/3) ... [2019-11-27 22:35:33,159 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-11-27 22:35:33,169 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:33,178 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:33,191 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:33,224 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:33,224 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:33,224 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:33,225 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:33,225 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:33,225 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:33,226 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:33,226 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-27 22:35:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:33,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:33,263 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:33,263 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-27 22:35:33,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:33,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928364195] [2019-11-27 22:35:33,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:33,467 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:33,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928364195] [2019-11-27 22:35:33,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:33,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:33,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767653966] [2019-11-27 22:35:33,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:33,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:33,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:33,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:33,495 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-27 22:35:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:33,723 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-27 22:35:33,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:33,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:33,745 INFO L225 Difference]: With dead ends: 251 [2019-11-27 22:35:33,746 INFO L226 Difference]: Without dead ends: 114 [2019-11-27 22:35:33,754 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:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-27 22:35:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-27 22:35:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-27 22:35:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-27 22:35:33,806 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-27 22:35:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:33,807 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-27 22:35:33,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-27 22:35:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:35:33,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:33,810 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:33,810 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:33,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-27 22:35:33,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:33,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570939172] [2019-11-27 22:35:33,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:33,907 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:33,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570939172] [2019-11-27 22:35:33,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:33,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:33,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926240586] [2019-11-27 22:35:33,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:33,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:33,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:33,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:33,911 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-27 22:35:34,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:34,109 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2019-11-27 22:35:34,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:34,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 22:35:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:34,111 INFO L225 Difference]: With dead ends: 238 [2019-11-27 22:35:34,112 INFO L226 Difference]: Without dead ends: 133 [2019-11-27 22:35:34,113 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:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-27 22:35:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-11-27 22:35:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-27 22:35:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-27 22:35:34,140 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-27 22:35:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:34,141 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-27 22:35:34,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-27 22:35:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 22:35:34,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:34,144 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:34,145 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:34,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:34,145 INFO L82 PathProgramCache]: Analyzing trace with hash -134115002, now seen corresponding path program 1 times [2019-11-27 22:35:34,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:34,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565557955] [2019-11-27 22:35:34,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:34,264 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:34,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565557955] [2019-11-27 22:35:34,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:34,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:34,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987144853] [2019-11-27 22:35:34,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:34,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:34,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:34,270 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-27 22:35:34,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:34,442 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-11-27 22:35:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:34,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-27 22:35:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:34,445 INFO L225 Difference]: With dead ends: 270 [2019-11-27 22:35:34,445 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 22:35:34,450 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:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 22:35:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-27 22:35:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 22:35:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-27 22:35:34,475 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-27 22:35:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:34,475 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-27 22:35:34,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-27 22:35:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:35:34,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:34,481 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:34,482 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:34,482 INFO L82 PathProgramCache]: Analyzing trace with hash -121422705, now seen corresponding path program 1 times [2019-11-27 22:35:34,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:34,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213405273] [2019-11-27 22:35:34,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:34,611 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:34,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213405273] [2019-11-27 22:35:34,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:34,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:34,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540446513] [2019-11-27 22:35:34,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:34,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:34,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:34,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:34,616 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-27 22:35:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:34,811 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-27 22:35:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:34,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:35:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:34,814 INFO L225 Difference]: With dead ends: 334 [2019-11-27 22:35:34,814 INFO L226 Difference]: Without dead ends: 196 [2019-11-27 22:35:34,815 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:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-27 22:35:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-27 22:35:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-27 22:35:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-27 22:35:34,843 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-27 22:35:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:34,846 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-27 22:35:34,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-27 22:35:34,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:35:34,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:34,850 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:34,850 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1926861039, now seen corresponding path program 1 times [2019-11-27 22:35:34,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:34,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720935583] [2019-11-27 22:35:34,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:34,908 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:34,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720935583] [2019-11-27 22:35:34,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:34,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:34,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973889651] [2019-11-27 22:35:34,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:34,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:34,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:34,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:34,911 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-27 22:35:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:35,042 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-27 22:35:35,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:35,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:35:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:35,045 INFO L225 Difference]: With dead ends: 389 [2019-11-27 22:35:35,045 INFO L226 Difference]: Without dead ends: 211 [2019-11-27 22:35:35,046 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:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-27 22:35:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-27 22:35:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-27 22:35:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-27 22:35:35,060 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-27 22:35:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:35,061 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-27 22:35:35,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:35,061 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-27 22:35:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:35:35,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:35,065 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:35,065 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash 398996882, now seen corresponding path program 1 times [2019-11-27 22:35:35,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:35,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729710453] [2019-11-27 22:35:35,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:35,130 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:35,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729710453] [2019-11-27 22:35:35,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:35,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:35,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159820784] [2019-11-27 22:35:35,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:35,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:35,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:35,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,133 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-27 22:35:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:35,268 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-27 22:35:35,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:35,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:35:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:35,270 INFO L225 Difference]: With dead ends: 427 [2019-11-27 22:35:35,271 INFO L226 Difference]: Without dead ends: 230 [2019-11-27 22:35:35,272 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:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-27 22:35:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-27 22:35:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-27 22:35:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-27 22:35:35,281 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-27 22:35:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:35,281 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-27 22:35:35,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-27 22:35:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:35:35,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:35,284 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:35,284 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:35,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:35,285 INFO L82 PathProgramCache]: Analyzing trace with hash 90409290, now seen corresponding path program 1 times [2019-11-27 22:35:35,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:35,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009798159] [2019-11-27 22:35:35,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:35,388 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:35,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009798159] [2019-11-27 22:35:35,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:35,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:35,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412525113] [2019-11-27 22:35:35,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:35,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:35,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,391 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-27 22:35:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:35,432 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-27 22:35:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:35,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-27 22:35:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:35,436 INFO L225 Difference]: With dead ends: 661 [2019-11-27 22:35:35,436 INFO L226 Difference]: Without dead ends: 443 [2019-11-27 22:35:35,437 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:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-27 22:35:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-27 22:35:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-27 22:35:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-27 22:35:35,470 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-27 22:35:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:35,471 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-27 22:35:35,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-27 22:35:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-27 22:35:35,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:35,473 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:35,473 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash 935055156, now seen corresponding path program 1 times [2019-11-27 22:35:35,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:35,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784259744] [2019-11-27 22:35:35,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:35,551 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:35,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784259744] [2019-11-27 22:35:35,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:35,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:35,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240717115] [2019-11-27 22:35:35,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:35,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:35,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:35,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,553 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-27 22:35:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:35,598 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-27 22:35:35,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:35,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-27 22:35:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:35,603 INFO L225 Difference]: With dead ends: 661 [2019-11-27 22:35:35,604 INFO L226 Difference]: Without dead ends: 659 [2019-11-27 22:35:35,605 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:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-27 22:35:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-27 22:35:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-27 22:35:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-27 22:35:35,623 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-27 22:35:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:35,623 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-27 22:35:35,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-27 22:35:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-27 22:35:35,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:35,627 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:35,627 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:35,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:35,628 INFO L82 PathProgramCache]: Analyzing trace with hash -365763014, now seen corresponding path program 1 times [2019-11-27 22:35:35,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:35,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722800454] [2019-11-27 22:35:35,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-27 22:35:35,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722800454] [2019-11-27 22:35:35,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:35,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:35,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108962969] [2019-11-27 22:35:35,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:35,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:35,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,711 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-27 22:35:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:35,886 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-27 22:35:35,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:35,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-27 22:35:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:35,892 INFO L225 Difference]: With dead ends: 1462 [2019-11-27 22:35:35,892 INFO L226 Difference]: Without dead ends: 809 [2019-11-27 22:35:35,894 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:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-27 22:35:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-27 22:35:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-27 22:35:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-27 22:35:35,917 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 175 [2019-11-27 22:35:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:35,918 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-27 22:35:35,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-27 22:35:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-27 22:35:35,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:35,922 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:35,922 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:35,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1933345798, now seen corresponding path program 2 times [2019-11-27 22:35:35,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:35,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851537852] [2019-11-27 22:35:35,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-27 22:35:35,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851537852] [2019-11-27 22:35:35,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:35,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:35,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884737911] [2019-11-27 22:35:35,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:35,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:35,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:35,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,983 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-27 22:35:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,163 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-11-27 22:35:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-27 22:35:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:36,170 INFO L225 Difference]: With dead ends: 1824 [2019-11-27 22:35:36,170 INFO L226 Difference]: Without dead ends: 1006 [2019-11-27 22:35:36,172 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,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-27 22:35:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-11-27 22:35:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-27 22:35:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-11-27 22:35:36,199 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-11-27 22:35:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:36,200 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-11-27 22:35:36,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-11-27 22:35:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-27 22:35:36,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:36,205 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:36,205 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1781023665, now seen corresponding path program 1 times [2019-11-27 22:35:36,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:36,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168741092] [2019-11-27 22:35:36,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-27 22:35:36,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168741092] [2019-11-27 22:35:36,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:36,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:36,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807016725] [2019-11-27 22:35:36,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:36,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:36,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:36,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,305 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-11-27 22:35:36,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,541 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-11-27 22:35:36,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-27 22:35:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:36,551 INFO L225 Difference]: With dead ends: 2080 [2019-11-27 22:35:36,551 INFO L226 Difference]: Without dead ends: 1079 [2019-11-27 22:35:36,553 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,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-27 22:35:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-11-27 22:35:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-27 22:35:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-11-27 22:35:36,594 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-11-27 22:35:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:36,595 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-11-27 22:35:36,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-11-27 22:35:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-27 22:35:36,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:36,603 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:36,603 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:36,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1647744508, now seen corresponding path program 1 times [2019-11-27 22:35:36,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:36,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526522096] [2019-11-27 22:35:36,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-27 22:35:36,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526522096] [2019-11-27 22:35:36,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:36,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:36,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310910339] [2019-11-27 22:35:36,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:36,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:36,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:36,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,792 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-11-27 22:35:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,982 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-11-27 22:35:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-27 22:35:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:36,989 INFO L225 Difference]: With dead ends: 2230 [2019-11-27 22:35:36,990 INFO L226 Difference]: Without dead ends: 1160 [2019-11-27 22:35:36,992 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,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-27 22:35:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-11-27 22:35:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-27 22:35:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-11-27 22:35:37,025 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-11-27 22:35:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,026 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-11-27 22:35:37,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-11-27 22:35:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-27 22:35:37,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,032 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:37,032 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1766185982, now seen corresponding path program 1 times [2019-11-27 22:35:37,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279039213] [2019-11-27 22:35:37,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-27 22:35:37,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279039213] [2019-11-27 22:35:37,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:37,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:37,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654486933] [2019-11-27 22:35:37,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,117 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-11-27 22:35:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,291 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-11-27 22:35:37,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-27 22:35:37,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,299 INFO L225 Difference]: With dead ends: 2398 [2019-11-27 22:35:37,299 INFO L226 Difference]: Without dead ends: 1256 [2019-11-27 22:35:37,301 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,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-11-27 22:35:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-11-27 22:35:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-27 22:35:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-11-27 22:35:37,337 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-11-27 22:35:37,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,337 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-11-27 22:35:37,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-11-27 22:35:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-27 22:35:37,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,343 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:37,343 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1276246012, now seen corresponding path program 1 times [2019-11-27 22:35:37,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179956673] [2019-11-27 22:35:37,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-11-27 22:35:37,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179956673] [2019-11-27 22:35:37,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:37,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:37,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449041579] [2019-11-27 22:35:37,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,453 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-11-27 22:35:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,494 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-11-27 22:35:37,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-27 22:35:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,507 INFO L225 Difference]: With dead ends: 3630 [2019-11-27 22:35:37,508 INFO L226 Difference]: Without dead ends: 2422 [2019-11-27 22:35:37,511 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,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-11-27 22:35:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-11-27 22:35:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-27 22:35:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-11-27 22:35:37,584 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-11-27 22:35:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,585 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-11-27 22:35:37,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-11-27 22:35:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-27 22:35:37,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,593 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:37,594 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1394687486, now seen corresponding path program 1 times [2019-11-27 22:35:37,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451771442] [2019-11-27 22:35:37,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-27 22:35:37,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451771442] [2019-11-27 22:35:37,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:37,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:37,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725883578] [2019-11-27 22:35:37,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,695 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-11-27 22:35:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,909 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-11-27 22:35:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-27 22:35:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,924 INFO L225 Difference]: With dead ends: 5143 [2019-11-27 22:35:37,925 INFO L226 Difference]: Without dead ends: 2702 [2019-11-27 22:35:37,929 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-11-27 22:35:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-11-27 22:35:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-11-27 22:35:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-11-27 22:35:38,013 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-11-27 22:35:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,014 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-11-27 22:35:38,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-11-27 22:35:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-27 22:35:38,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,024 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,024 INFO L82 PathProgramCache]: Analyzing trace with hash -777084420, now seen corresponding path program 1 times [2019-11-27 22:35:38,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680505941] [2019-11-27 22:35:38,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-27 22:35:38,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680505941] [2019-11-27 22:35:38,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:38,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:38,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573776660] [2019-11-27 22:35:38,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:38,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:38,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:38,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,206 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-11-27 22:35:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,408 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-11-27 22:35:38,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:38,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-27 22:35:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,423 INFO L225 Difference]: With dead ends: 5335 [2019-11-27 22:35:38,423 INFO L226 Difference]: Without dead ends: 2696 [2019-11-27 22:35:38,428 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,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-27 22:35:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-11-27 22:35:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-27 22:35:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-11-27 22:35:38,504 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-11-27 22:35:38,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,505 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-11-27 22:35:38,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-11-27 22:35:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-27 22:35:38,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,514 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,514 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,515 INFO L82 PathProgramCache]: Analyzing trace with hash -844895981, now seen corresponding path program 1 times [2019-11-27 22:35:38,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821463456] [2019-11-27 22:35:38,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-27 22:35:38,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821463456] [2019-11-27 22:35:38,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:38,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:38,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032576277] [2019-11-27 22:35:38,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:38,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:38,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:38,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,633 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-11-27 22:35:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,815 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-11-27 22:35:38,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:38,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-27 22:35:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,832 INFO L225 Difference]: With dead ends: 5299 [2019-11-27 22:35:38,832 INFO L226 Difference]: Without dead ends: 2684 [2019-11-27 22:35:38,838 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,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-27 22:35:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-11-27 22:35:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-27 22:35:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-11-27 22:35:38,933 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 321 [2019-11-27 22:35:38,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,934 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-11-27 22:35:38,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-11-27 22:35:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-27 22:35:38,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,948 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash 798876465, now seen corresponding path program 1 times [2019-11-27 22:35:38,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265011269] [2019-11-27 22:35:38,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-27 22:35:39,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265011269] [2019-11-27 22:35:39,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:39,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:39,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596498299] [2019-11-27 22:35:39,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:39,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:39,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:39,151 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-11-27 22:35:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:39,350 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-11-27 22:35:39,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:39,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-27 22:35:39,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:39,367 INFO L225 Difference]: With dead ends: 5545 [2019-11-27 22:35:39,367 INFO L226 Difference]: Without dead ends: 2930 [2019-11-27 22:35:39,372 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,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-11-27 22:35:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-11-27 22:35:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-27 22:35:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-11-27 22:35:39,453 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-11-27 22:35:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:39,454 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-11-27 22:35:39,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-11-27 22:35:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-27 22:35:39,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:39,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,466 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:39,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:39,466 INFO L82 PathProgramCache]: Analyzing trace with hash 668596020, now seen corresponding path program 1 times [2019-11-27 22:35:39,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:39,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3388380] [2019-11-27 22:35:39,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-27 22:35:39,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3388380] [2019-11-27 22:35:39,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:39,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:39,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667100722] [2019-11-27 22:35:39,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:39,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:39,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:39,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:39,624 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-11-27 22:35:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:39,704 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-11-27 22:35:39,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:39,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-27 22:35:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:39,727 INFO L225 Difference]: With dead ends: 7734 [2019-11-27 22:35:39,728 INFO L226 Difference]: Without dead ends: 5029 [2019-11-27 22:35:39,734 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,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-11-27 22:35:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-11-27 22:35:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-27 22:35:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-11-27 22:35:39,854 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-11-27 22:35:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:39,855 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-11-27 22:35:39,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-11-27 22:35:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-11-27 22:35:39,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:39,868 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,868 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:39,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:39,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1546862455, now seen corresponding path program 1 times [2019-11-27 22:35:39,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:39,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509659286] [2019-11-27 22:35:39,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-27 22:35:40,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509659286] [2019-11-27 22:35:40,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361818630] [2019-11-27 22:35:40,058 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:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:40,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:40,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-27 22:35:40,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:35:40,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:35:40,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785586266] [2019-11-27 22:35:40,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:40,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:40,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:40,421 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-11-27 22:35:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:40,865 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-11-27 22:35:40,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:40,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2019-11-27 22:35:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:40,896 INFO L225 Difference]: With dead ends: 9987 [2019-11-27 22:35:40,897 INFO L226 Difference]: Without dead ends: 7540 [2019-11-27 22:35:40,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 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:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-11-27 22:35:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-11-27 22:35:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-27 22:35:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-11-27 22:35:41,154 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 360 [2019-11-27 22:35:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:41,155 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-11-27 22:35:41,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-11-27 22:35:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-27 22:35:41,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:41,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:41,373 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:41,373 INFO L82 PathProgramCache]: Analyzing trace with hash 774755817, now seen corresponding path program 2 times [2019-11-27 22:35:41,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:41,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865122730] [2019-11-27 22:35:41,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-27 22:35:41,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865122730] [2019-11-27 22:35:41,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090439187] [2019-11-27 22:35:41,627 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:41,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:35:41,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:35:41,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:41,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-27 22:35:41,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:35:41,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:35:41,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445943] [2019-11-27 22:35:41,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:41,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:41,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:41,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:41,987 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-11-27 22:35:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:42,328 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-11-27 22:35:42,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:42,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-27 22:35:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:42,342 INFO L225 Difference]: With dead ends: 12544 [2019-11-27 22:35:42,343 INFO L226 Difference]: Without dead ends: 6979 [2019-11-27 22:35:42,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-27 22:35:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-11-27 22:35:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-11-27 22:35:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-11-27 22:35:42,517 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-11-27 22:35:42,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:42,518 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-11-27 22:35:42,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-11-27 22:35:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-27 22:35:42,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:42,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:42,736 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash 256545513, now seen corresponding path program 1 times [2019-11-27 22:35:42,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:42,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892669891] [2019-11-27 22:35:42,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-27 22:35:42,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892669891] [2019-11-27 22:35:42,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:42,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:42,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268860208] [2019-11-27 22:35:42,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:42,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:42,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:42,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:42,902 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-11-27 22:35:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:43,097 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-11-27 22:35:43,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:43,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-27 22:35:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:43,105 INFO L225 Difference]: With dead ends: 11015 [2019-11-27 22:35:43,105 INFO L226 Difference]: Without dead ends: 3069 [2019-11-27 22:35:43,115 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:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-27 22:35:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-11-27 22:35:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-27 22:35:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-11-27 22:35:43,178 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-11-27 22:35:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:43,178 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-11-27 22:35:43,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-11-27 22:35:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-11-27 22:35:43,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:43,186 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:43,186 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:43,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:43,187 INFO L82 PathProgramCache]: Analyzing trace with hash 930203824, now seen corresponding path program 1 times [2019-11-27 22:35:43,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:43,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252553488] [2019-11-27 22:35:43,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-11-27 22:35:43,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252553488] [2019-11-27 22:35:43,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750458521] [2019-11-27 22:35:43,509 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:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:43,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:43,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-11-27 22:35:44,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:35:44,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-27 22:35:44,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977978158] [2019-11-27 22:35:44,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:44,133 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-11-27 22:35:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,166 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-11-27 22:35:44,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2019-11-27 22:35:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,171 INFO L225 Difference]: With dead ends: 3028 [2019-11-27 22:35:44,172 INFO L226 Difference]: Without dead ends: 2531 [2019-11-27 22:35:44,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-11-27 22:35:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-11-27 22:35:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-27 22:35:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-11-27 22:35:44,221 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 510 [2019-11-27 22:35:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,222 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-11-27 22:35:44,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-11-27 22:35:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-11-27 22:35:44,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,229 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:44,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:44,436 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1673743471, now seen corresponding path program 1 times [2019-11-27 22:35:44,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177283308] [2019-11-27 22:35:44,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1623 proven. 14 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-11-27 22:35:44,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177283308] [2019-11-27 22:35:44,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126885237] [2019-11-27 22:35:44,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:35:44,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2019-11-27 22:35:44,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:35:44,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-27 22:35:44,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226871179] [2019-11-27 22:35:44,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:44,945 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-11-27 22:35:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,122 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-11-27 22:35:45,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2019-11-27 22:35:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,128 INFO L225 Difference]: With dead ends: 5060 [2019-11-27 22:35:45,128 INFO L226 Difference]: Without dead ends: 2589 [2019-11-27 22:35:45,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:45,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-11-27 22:35:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-11-27 22:35:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-11-27 22:35:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-11-27 22:35:45,173 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 511 [2019-11-27 22:35:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,174 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-11-27 22:35:45,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-11-27 22:35:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2019-11-27 22:35:45,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,182 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:45,386 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434925, now seen corresponding path program 2 times [2019-11-27 22:35:45,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977111898] [2019-11-27 22:35:45,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-27 22:35:45,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977111898] [2019-11-27 22:35:45,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951278950] [2019-11-27 22:35:45,678 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:45,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:35:45,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:35:45,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:45,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-27 22:35:46,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:35:46,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:35:46,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078571158] [2019-11-27 22:35:46,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:46,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:46,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:46,163 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-11-27 22:35:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,344 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-11-27 22:35:46,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:46,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 622 [2019-11-27 22:35:46,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,345 INFO L225 Difference]: With dead ends: 2848 [2019-11-27 22:35:46,345 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:35:46,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 624 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:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:35:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:35:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:35:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:35:46,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 622 [2019-11-27 22:35:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,350 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:35:46,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:35:46,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:35:46,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:46,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:35:47,123 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-11-27 22:35:47,942 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-27 22:35:48,384 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-27 22:35:48,487 INFO L242 CegarLoopResult]: At program point L168(lines 164 498) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:35:48,487 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:48,487 INFO L246 CegarLoopResult]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-27 22:35:48,488 INFO L246 CegarLoopResult]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-27 22:35:48,488 INFO L246 CegarLoopResult]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-11-27 22:35:48,488 INFO L246 CegarLoopResult]: For program point L434-2(lines 434 438) no Hoare annotation was computed. [2019-11-27 22:35:48,488 INFO L246 CegarLoopResult]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-11-27 22:35:48,488 INFO L246 CegarLoopResult]: For program point L269(lines 269 271) no Hoare annotation was computed. [2019-11-27 22:35:48,488 INFO L246 CegarLoopResult]: For program point L335-2(lines 335 339) no Hoare annotation was computed. [2019-11-27 22:35:48,488 INFO L246 CegarLoopResult]: For program point L269-2(lines 201 484) no Hoare annotation was computed. [2019-11-27 22:35:48,488 INFO L246 CegarLoopResult]: For program point L170(lines 170 496) no Hoare annotation was computed. [2019-11-27 22:35:48,488 INFO L246 CegarLoopResult]: For program point L137(lines 137 507) no Hoare annotation was computed. [2019-11-27 22:35:48,488 INFO L246 CegarLoopResult]: For program point L104(lines 104 518) no Hoare annotation was computed. [2019-11-27 22:35:48,489 INFO L242 CegarLoopResult]: At program point L138(lines 134 508) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-27 22:35:48,489 INFO L246 CegarLoopResult]: For program point L304(lines 304 306) no Hoare annotation was computed. [2019-11-27 22:35:48,489 INFO L246 CegarLoopResult]: For program point L238(lines 238 241) no Hoare annotation was computed. [2019-11-27 22:35:48,489 INFO L246 CegarLoopResult]: For program point L304-2(lines 201 484) no Hoare annotation was computed. [2019-11-27 22:35:48,489 INFO L246 CegarLoopResult]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-27 22:35:48,489 INFO L246 CegarLoopResult]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-11-27 22:35:48,489 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:48,489 INFO L246 CegarLoopResult]: For program point L173(lines 173 495) no Hoare annotation was computed. [2019-11-27 22:35:48,490 INFO L246 CegarLoopResult]: For program point L140(lines 140 506) no Hoare annotation was computed. [2019-11-27 22:35:48,491 INFO L246 CegarLoopResult]: For program point L107(lines 107 517) no Hoare annotation was computed. [2019-11-27 22:35:48,491 INFO L242 CegarLoopResult]: At program point L174(lines 170 496) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:35:48,491 INFO L246 CegarLoopResult]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-11-27 22:35:48,491 INFO L246 CegarLoopResult]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2019-11-27 22:35:48,491 INFO L249 CegarLoopResult]: At program point L539(lines 97 540) the Hoare annotation is: true [2019-11-27 22:35:48,492 INFO L246 CegarLoopResult]: For program point L275(lines 275 279) no Hoare annotation was computed. [2019-11-27 22:35:48,492 INFO L246 CegarLoopResult]: For program point L275-2(lines 275 279) no Hoare annotation was computed. [2019-11-27 22:35:48,492 INFO L246 CegarLoopResult]: For program point L176(lines 176 494) no Hoare annotation was computed. [2019-11-27 22:35:48,492 INFO L246 CegarLoopResult]: For program point L143(lines 143 505) no Hoare annotation was computed. [2019-11-27 22:35:48,492 INFO L246 CegarLoopResult]: For program point L110(lines 110 516) no Hoare annotation was computed. [2019-11-27 22:35:48,492 INFO L242 CegarLoopResult]: At program point L144(lines 140 506) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:35:48,493 INFO L246 CegarLoopResult]: For program point L211(lines 211 213) no Hoare annotation was computed. [2019-11-27 22:35:48,493 INFO L246 CegarLoopResult]: For program point L211-2(lines 211 213) no Hoare annotation was computed. [2019-11-27 22:35:48,493 INFO L246 CegarLoopResult]: For program point L179(lines 179 493) no Hoare annotation was computed. [2019-11-27 22:35:48,493 INFO L246 CegarLoopResult]: For program point L146(lines 146 504) no Hoare annotation was computed. [2019-11-27 22:35:48,493 INFO L246 CegarLoopResult]: For program point L113(lines 113 515) no Hoare annotation was computed. [2019-11-27 22:35:48,493 INFO L246 CegarLoopResult]: For program point L477(lines 477 479) no Hoare annotation was computed. [2019-11-27 22:35:48,494 INFO L246 CegarLoopResult]: For program point L444(lines 444 455) no Hoare annotation was computed. [2019-11-27 22:35:48,494 INFO L246 CegarLoopResult]: For program point L411(lines 411 425) no Hoare annotation was computed. [2019-11-27 22:35:48,494 INFO L246 CegarLoopResult]: For program point L411-1(lines 411 425) no Hoare annotation was computed. [2019-11-27 22:35:48,494 INFO L246 CegarLoopResult]: For program point L444-2(lines 444 455) no Hoare annotation was computed. [2019-11-27 22:35:48,494 INFO L246 CegarLoopResult]: For program point L312(lines 312 315) no Hoare annotation was computed. [2019-11-27 22:35:48,495 INFO L242 CegarLoopResult]: At program point L180(lines 176 494) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-27 22:35:48,495 INFO L246 CegarLoopResult]: For program point L544(lines 544 546) no Hoare annotation was computed. [2019-11-27 22:35:48,495 INFO L246 CegarLoopResult]: For program point L544-2(lines 544 546) no Hoare annotation was computed. [2019-11-27 22:35:48,495 INFO L246 CegarLoopResult]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-11-27 22:35:48,495 INFO L246 CegarLoopResult]: For program point L182(lines 182 492) no Hoare annotation was computed. [2019-11-27 22:35:48,496 INFO L246 CegarLoopResult]: For program point L149(lines 149 503) no Hoare annotation was computed. [2019-11-27 22:35:48,496 INFO L246 CegarLoopResult]: For program point L116(lines 116 514) no Hoare annotation was computed. [2019-11-27 22:35:48,496 INFO L246 CegarLoopResult]: For program point L381(lines 381 383) no Hoare annotation was computed. [2019-11-27 22:35:48,496 INFO L246 CegarLoopResult]: For program point L216(lines 216 219) no Hoare annotation was computed. [2019-11-27 22:35:48,496 INFO L242 CegarLoopResult]: At program point L150(lines 146 504) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:35:48,497 INFO L246 CegarLoopResult]: For program point L84(lines 84 90) no Hoare annotation was computed. [2019-11-27 22:35:48,497 INFO L246 CegarLoopResult]: For program point L415(lines 415 421) no Hoare annotation was computed. [2019-11-27 22:35:48,497 INFO L246 CegarLoopResult]: For program point L250(lines 250 256) no Hoare annotation was computed. [2019-11-27 22:35:48,497 INFO L246 CegarLoopResult]: For program point L449(lines 449 452) no Hoare annotation was computed. [2019-11-27 22:35:48,497 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:35:48,497 INFO L246 CegarLoopResult]: For program point L185(lines 185 491) no Hoare annotation was computed. [2019-11-27 22:35:48,498 INFO L246 CegarLoopResult]: For program point L152(lines 152 502) no Hoare annotation was computed. [2019-11-27 22:35:48,498 INFO L246 CegarLoopResult]: For program point L119(lines 119 513) no Hoare annotation was computed. [2019-11-27 22:35:48,498 INFO L249 CegarLoopResult]: At program point L549(lines 10 551) the Hoare annotation is: true [2019-11-27 22:35:48,498 INFO L242 CegarLoopResult]: At program point L186(lines 182 492) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-27 22:35:48,498 INFO L242 CegarLoopResult]: At program point L120(lines 116 514) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:35:48,499 INFO L246 CegarLoopResult]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-27 22:35:48,499 INFO L246 CegarLoopResult]: For program point L87-2(lines 84 90) no Hoare annotation was computed. [2019-11-27 22:35:48,499 INFO L246 CegarLoopResult]: For program point L286(lines 286 296) no Hoare annotation was computed. [2019-11-27 22:35:48,499 INFO L246 CegarLoopResult]: For program point L253(lines 253 255) no Hoare annotation was computed. [2019-11-27 22:35:48,499 INFO L246 CegarLoopResult]: For program point L286-2(lines 286 296) no Hoare annotation was computed. [2019-11-27 22:35:48,499 INFO L246 CegarLoopResult]: For program point L253-2(lines 201 484) no Hoare annotation was computed. [2019-11-27 22:35:48,500 INFO L242 CegarLoopResult]: At program point L485(lines 98 538) the Hoare annotation is: (let ((.cse8 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse12 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (not .cse8)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse0) (and .cse4 .cse5) (and .cse6 .cse7 .cse8 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse7 .cse8 .cse5 .cse9) (and .cse0 .cse4 .cse8) (and .cse10 .cse11 .cse12 .cse8 .cse5) (and .cse2 .cse3 .cse12 .cse8 .cse5) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse8) (and .cse1 .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse8 .cse9) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse6 .cse0)))) [2019-11-27 22:35:48,500 INFO L246 CegarLoopResult]: For program point L320(lines 320 322) no Hoare annotation was computed. [2019-11-27 22:35:48,500 INFO L246 CegarLoopResult]: For program point L188(lines 188 490) no Hoare annotation was computed. [2019-11-27 22:35:48,501 INFO L246 CegarLoopResult]: For program point L155(lines 155 501) no Hoare annotation was computed. [2019-11-27 22:35:48,501 INFO L246 CegarLoopResult]: For program point L122(lines 122 512) no Hoare annotation was computed. [2019-11-27 22:35:48,501 INFO L246 CegarLoopResult]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-11-27 22:35:48,501 INFO L242 CegarLoopResult]: At program point L321(lines 75 550) the Hoare annotation is: false [2019-11-27 22:35:48,501 INFO L246 CegarLoopResult]: For program point L387-2(lines 201 484) no Hoare annotation was computed. [2019-11-27 22:35:48,501 INFO L246 CegarLoopResult]: For program point L222(lines 222 233) no Hoare annotation was computed. [2019-11-27 22:35:48,502 INFO L246 CegarLoopResult]: For program point L222-2(lines 201 484) no Hoare annotation was computed. [2019-11-27 22:35:48,502 INFO L246 CegarLoopResult]: For program point L520(lines 520 536) no Hoare annotation was computed. [2019-11-27 22:35:48,502 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:35:48,502 INFO L246 CegarLoopResult]: For program point L521(lines 521 535) no Hoare annotation was computed. [2019-11-27 22:35:48,502 INFO L246 CegarLoopResult]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-27 22:35:48,502 INFO L246 CegarLoopResult]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-27 22:35:48,503 INFO L246 CegarLoopResult]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-27 22:35:48,503 INFO L246 CegarLoopResult]: For program point L224(lines 224 227) no Hoare annotation was computed. [2019-11-27 22:35:48,503 INFO L246 CegarLoopResult]: For program point L290-2(lines 288 296) no Hoare annotation was computed. [2019-11-27 22:35:48,503 INFO L246 CegarLoopResult]: For program point L191(lines 191 489) no Hoare annotation was computed. [2019-11-27 22:35:48,503 INFO L246 CegarLoopResult]: For program point L158(lines 158 500) no Hoare annotation was computed. [2019-11-27 22:35:48,504 INFO L246 CegarLoopResult]: For program point L125(lines 125 511) no Hoare annotation was computed. [2019-11-27 22:35:48,504 INFO L246 CegarLoopResult]: For program point L92(lines 92 96) no Hoare annotation was computed. [2019-11-27 22:35:48,504 INFO L246 CegarLoopResult]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-11-27 22:35:48,504 INFO L246 CegarLoopResult]: For program point L522-2(lines 521 535) no Hoare annotation was computed. [2019-11-27 22:35:48,504 INFO L242 CegarLoopResult]: At program point L192(lines 188 490) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-27 22:35:48,505 INFO L242 CegarLoopResult]: At program point L126(lines 122 512) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:35:48,505 INFO L246 CegarLoopResult]: For program point L93(lines 93 95) no Hoare annotation was computed. [2019-11-27 22:35:48,505 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:35:48,505 INFO L246 CegarLoopResult]: For program point L524(lines 524 526) no Hoare annotation was computed. [2019-11-27 22:35:48,505 INFO L246 CegarLoopResult]: For program point L194(lines 194 488) no Hoare annotation was computed. [2019-11-27 22:35:48,505 INFO L246 CegarLoopResult]: For program point L161(lines 161 499) no Hoare annotation was computed. [2019-11-27 22:35:48,505 INFO L246 CegarLoopResult]: For program point L128(lines 128 510) no Hoare annotation was computed. [2019-11-27 22:35:48,506 INFO L246 CegarLoopResult]: For program point L360(lines 360 365) no Hoare annotation was computed. [2019-11-27 22:35:48,506 INFO L246 CegarLoopResult]: For program point L360-2(lines 360 365) no Hoare annotation was computed. [2019-11-27 22:35:48,506 INFO L246 CegarLoopResult]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-11-27 22:35:48,506 INFO L242 CegarLoopResult]: At program point L195(lines 194 488) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-27 22:35:48,507 INFO L242 CegarLoopResult]: At program point L162(lines 152 502) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-27 22:35:48,507 INFO L246 CegarLoopResult]: For program point L460-1(lines 460 462) no Hoare annotation was computed. [2019-11-27 22:35:48,507 INFO L246 CegarLoopResult]: For program point L262(lines 262 264) no Hoare annotation was computed. [2019-11-27 22:35:48,507 INFO L249 CegarLoopResult]: At program point L560(lines 552 562) the Hoare annotation is: true [2019-11-27 22:35:48,507 INFO L246 CegarLoopResult]: For program point L197(lines 197 487) no Hoare annotation was computed. [2019-11-27 22:35:48,507 INFO L246 CegarLoopResult]: For program point L164(lines 164 498) no Hoare annotation was computed. [2019-11-27 22:35:48,508 INFO L246 CegarLoopResult]: For program point L131(lines 131 509) no Hoare annotation was computed. [2019-11-27 22:35:48,508 INFO L246 CegarLoopResult]: For program point L98-1(lines 75 550) no Hoare annotation was computed. [2019-11-27 22:35:48,508 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-11-27 22:35:48,508 INFO L246 CegarLoopResult]: For program point L396(lines 396 399) no Hoare annotation was computed. [2019-11-27 22:35:48,509 INFO L249 CegarLoopResult]: At program point L198(lines 197 487) the Hoare annotation is: true [2019-11-27 22:35:48,509 INFO L242 CegarLoopResult]: At program point L132(lines 128 510) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-27 22:35:48,509 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-27 22:35:48,509 INFO L246 CegarLoopResult]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-11-27 22:35:48,509 INFO L246 CegarLoopResult]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-27 22:35:48,510 INFO L246 CegarLoopResult]: For program point L332(lines 332 334) no Hoare annotation was computed. [2019-11-27 22:35:48,510 INFO L249 CegarLoopResult]: At program point L200(lines 199 487) the Hoare annotation is: true [2019-11-27 22:35:48,510 INFO L246 CegarLoopResult]: For program point L167(lines 167 497) no Hoare annotation was computed. [2019-11-27 22:35:48,510 INFO L246 CegarLoopResult]: For program point L134(lines 134 508) no Hoare annotation was computed. [2019-11-27 22:35:48,510 INFO L246 CegarLoopResult]: For program point L101(lines 101 519) no Hoare annotation was computed. [2019-11-27 22:35:48,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:48 BoogieIcfgContainer [2019-11-27 22:35:48,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:48,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:48,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:48,538 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:48,538 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:33" (3/4) ... [2019-11-27 22:35:48,545 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:35:48,579 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:35:48,580 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:35:48,746 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:48,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:48,748 INFO L168 Benchmark]: Toolchain (without parser) took 17091.03 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 956.3 MB in the beginning and 1.4 GB in the end (delta: -445.1 MB). Peak memory consumption was 565.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,750 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:48,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.87 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:48,751 INFO L168 Benchmark]: Boogie Preprocessor took 55.82 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:48,752 INFO L168 Benchmark]: RCFGBuilder took 862.54 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: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,752 INFO L168 Benchmark]: TraceAbstraction took 15386.57 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 860.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -348.1 MB). Peak memory consumption was 512.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,752 INFO L168 Benchmark]: Witness Printer took 209.43 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:48,754 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 509.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.87 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 55.82 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 862.54 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: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15386.57 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 860.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -348.1 MB). Peak memory consumption was 512.3 MB. Max. memory is 11.5 GB. * Witness Printer took 209.43 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. 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 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || (((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 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 <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 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) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((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) && 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)) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 13.3s, OverallIterations: 25, TraceHistogramMax: 22, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 4490 SDtfs, 2115 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2456 GetRequests, 2421 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 425 HoareAnnotationTreeSize, 22 FomulaSimplifications, 31460 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24851 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 8555 NumberOfCodeBlocks, 8555 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8525 ConstructedInterpolants, 0 QuantifiedInterpolants, 4552471 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3948 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 38935/39021 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...