./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.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_srvr_14.cil.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 f0194e72737fa00e9def2494335d4249cbea0bcd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:35:41,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:41,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:41,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:41,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:41,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:41,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:41,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:41,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:41,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:41,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:41,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:41,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:41,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:41,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:41,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:41,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:41,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:41,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:41,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:41,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:41,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:41,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:41,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:41,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:41,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:41,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:41,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:41,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:41,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:41,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:41,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:41,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:41,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:41,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:41,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:41,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:41,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:41,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:41,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:41,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:41,488 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:41,502 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:41,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:41,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:41,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:41,503 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:41,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:41,504 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:41,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:41,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:41,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:41,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:41,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:41,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:41,505 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:41,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:41,506 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:41,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:41,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:41,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:41,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:41,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:41,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:41,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:41,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:41,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:41,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:41,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:41,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:41,509 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 -> f0194e72737fa00e9def2494335d4249cbea0bcd [2019-11-27 22:35:41,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:41,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:41,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:41,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:41,878 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:41,880 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c [2019-11-27 22:35:41,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bf4b2202/d29dd8a7c4b7462dba6cd2c0f4485bfe/FLAGfc77e91e9 [2019-11-27 22:35:42,418 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:42,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c [2019-11-27 22:35:42,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bf4b2202/d29dd8a7c4b7462dba6cd2c0f4485bfe/FLAGfc77e91e9 [2019-11-27 22:35:42,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bf4b2202/d29dd8a7c4b7462dba6cd2c0f4485bfe [2019-11-27 22:35:42,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:42,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:42,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:42,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:42,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:42,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:42" (1/1) ... [2019-11-27 22:35:42,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa014cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:42, skipping insertion in model container [2019-11-27 22:35:42,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:42" (1/1) ... [2019-11-27 22:35:42,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:42,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:43,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:43,120 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:43,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:43,266 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:43,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:43 WrapperNode [2019-11-27 22:35:43,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:43,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:43,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:43,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:43,275 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:43" (1/1) ... [2019-11-27 22:35:43,284 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:43" (1/1) ... [2019-11-27 22:35:43,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:43,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:43,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:43,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:43,336 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:43" (1/1) ... [2019-11-27 22:35:43,337 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:43" (1/1) ... [2019-11-27 22:35:43,340 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:43" (1/1) ... [2019-11-27 22:35:43,340 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:43" (1/1) ... [2019-11-27 22:35:43,348 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:43" (1/1) ... [2019-11-27 22:35:43,368 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:43" (1/1) ... [2019-11-27 22:35:43,371 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:43" (1/1) ... [2019-11-27 22:35:43,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:43,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:43,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:43,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:43,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:43" (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:43,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:43,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:43,630 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:44,250 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-27 22:35:44,251 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-27 22:35:44,256 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:44,257 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:44,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:44 BoogieIcfgContainer [2019-11-27 22:35:44,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:44,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:44,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:44,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:44,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:42" (1/3) ... [2019-11-27 22:35:44,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc9b0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:44, skipping insertion in model container [2019-11-27 22:35:44,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:43" (2/3) ... [2019-11-27 22:35:44,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc9b0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:44, skipping insertion in model container [2019-11-27 22:35:44,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:44" (3/3) ... [2019-11-27 22:35:44,270 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-11-27 22:35:44,280 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:44,286 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:44,297 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:44,324 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:44,324 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:44,324 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:44,324 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:44,324 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:44,325 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:44,325 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:44,325 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-11-27 22:35:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:35:44,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,352 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] [2019-11-27 22:35:44,353 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1734880928, now seen corresponding path program 1 times [2019-11-27 22:35:44,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786274461] [2019-11-27 22:35:44,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,558 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:44,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786274461] [2019-11-27 22:35:44,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:44,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502446169] [2019-11-27 22:35:44,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,585 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2019-11-27 22:35:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,856 INFO L93 Difference]: Finished difference Result 323 states and 555 transitions. [2019-11-27 22:35:44,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-27 22:35:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,873 INFO L225 Difference]: With dead ends: 323 [2019-11-27 22:35:44,873 INFO L226 Difference]: Without dead ends: 160 [2019-11-27 22:35:44,878 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:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-27 22:35:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-11-27 22:35:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-27 22:35:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2019-11-27 22:35:44,940 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 22 [2019-11-27 22:35:44,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,941 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2019-11-27 22:35:44,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2019-11-27 22:35:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:44,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,943 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:44,943 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash -923936279, now seen corresponding path program 1 times [2019-11-27 22:35:44,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679291713] [2019-11-27 22:35:44,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:45,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679291713] [2019-11-27 22:35:45,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171776586] [2019-11-27 22:35:45,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,010 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand 3 states. [2019-11-27 22:35:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,187 INFO L93 Difference]: Finished difference Result 330 states and 522 transitions. [2019-11-27 22:35:45,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,191 INFO L225 Difference]: With dead ends: 330 [2019-11-27 22:35:45,191 INFO L226 Difference]: Without dead ends: 181 [2019-11-27 22:35:45,193 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:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-27 22:35:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-11-27 22:35:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-27 22:35:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 281 transitions. [2019-11-27 22:35:45,210 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 281 transitions. Word has length 23 [2019-11-27 22:35:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,211 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 281 transitions. [2019-11-27 22:35:45,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 281 transitions. [2019-11-27 22:35:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:45,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,213 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:45,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash -936892908, now seen corresponding path program 1 times [2019-11-27 22:35:45,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081749160] [2019-11-27 22:35:45,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,290 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:45,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081749160] [2019-11-27 22:35:45,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409655953] [2019-11-27 22:35:45,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,294 INFO L87 Difference]: Start difference. First operand 179 states and 281 transitions. Second operand 3 states. [2019-11-27 22:35:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,478 INFO L93 Difference]: Finished difference Result 361 states and 566 transitions. [2019-11-27 22:35:45,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:45,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,483 INFO L225 Difference]: With dead ends: 361 [2019-11-27 22:35:45,483 INFO L226 Difference]: Without dead ends: 189 [2019-11-27 22:35:45,486 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:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-27 22:35:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2019-11-27 22:35:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-27 22:35:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 292 transitions. [2019-11-27 22:35:45,515 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 292 transitions. Word has length 23 [2019-11-27 22:35:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,515 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 292 transitions. [2019-11-27 22:35:45,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 292 transitions. [2019-11-27 22:35:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:45,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,518 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:45,519 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1640243884, now seen corresponding path program 1 times [2019-11-27 22:35:45,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679749115] [2019-11-27 22:35:45,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,609 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:45,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679749115] [2019-11-27 22:35:45,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794167430] [2019-11-27 22:35:45,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,612 INFO L87 Difference]: Start difference. First operand 185 states and 292 transitions. Second operand 3 states. [2019-11-27 22:35:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,755 INFO L93 Difference]: Finished difference Result 366 states and 576 transitions. [2019-11-27 22:35:45,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,757 INFO L225 Difference]: With dead ends: 366 [2019-11-27 22:35:45,757 INFO L226 Difference]: Without dead ends: 188 [2019-11-27 22:35:45,758 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:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-27 22:35:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-11-27 22:35:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 22:35:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2019-11-27 22:35:45,774 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 23 [2019-11-27 22:35:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,774 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2019-11-27 22:35:45,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2019-11-27 22:35:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:35:45,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,778 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, 1] [2019-11-27 22:35:45,778 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,780 INFO L82 PathProgramCache]: Analyzing trace with hash 940477948, now seen corresponding path program 1 times [2019-11-27 22:35:45,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094479239] [2019-11-27 22:35:45,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,815 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:45,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094479239] [2019-11-27 22:35:45,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355201033] [2019-11-27 22:35:45,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,818 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 3 states. [2019-11-27 22:35:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,966 INFO L93 Difference]: Finished difference Result 377 states and 588 transitions. [2019-11-27 22:35:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 22:35:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,968 INFO L225 Difference]: With dead ends: 377 [2019-11-27 22:35:45,969 INFO L226 Difference]: Without dead ends: 198 [2019-11-27 22:35:45,970 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:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-27 22:35:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-27 22:35:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 22:35:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2019-11-27 22:35:45,981 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 24 [2019-11-27 22:35:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,982 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2019-11-27 22:35:45,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2019-11-27 22:35:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:35:45,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,984 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, 1, 1] [2019-11-27 22:35:45,984 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1862867376, now seen corresponding path program 1 times [2019-11-27 22:35:45,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440941639] [2019-11-27 22:35:45,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,030 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:46,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440941639] [2019-11-27 22:35:46,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358087094] [2019-11-27 22:35:46,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,035 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand 3 states. [2019-11-27 22:35:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,175 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2019-11-27 22:35:46,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-27 22:35:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,177 INFO L225 Difference]: With dead ends: 377 [2019-11-27 22:35:46,178 INFO L226 Difference]: Without dead ends: 198 [2019-11-27 22:35:46,178 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:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-27 22:35:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-27 22:35:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 22:35:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2019-11-27 22:35:46,194 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 25 [2019-11-27 22:35:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,194 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2019-11-27 22:35:46,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2019-11-27 22:35:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:35:46,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,200 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, 1, 1, 1] [2019-11-27 22:35:46,200 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2134464983, now seen corresponding path program 1 times [2019-11-27 22:35:46,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662230370] [2019-11-27 22:35:46,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,257 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:46,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662230370] [2019-11-27 22:35:46,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247555140] [2019-11-27 22:35:46,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,264 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand 3 states. [2019-11-27 22:35:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,396 INFO L93 Difference]: Finished difference Result 377 states and 580 transitions. [2019-11-27 22:35:46,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-27 22:35:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,399 INFO L225 Difference]: With dead ends: 377 [2019-11-27 22:35:46,399 INFO L226 Difference]: Without dead ends: 198 [2019-11-27 22:35:46,400 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:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-27 22:35:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-27 22:35:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 22:35:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 287 transitions. [2019-11-27 22:35:46,410 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 287 transitions. Word has length 26 [2019-11-27 22:35:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,411 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 287 transitions. [2019-11-27 22:35:46,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 287 transitions. [2019-11-27 22:35:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:35:46,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,412 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, 1, 1, 1] [2019-11-27 22:35:46,413 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,413 INFO L82 PathProgramCache]: Analyzing trace with hash 744248342, now seen corresponding path program 1 times [2019-11-27 22:35:46,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557178827] [2019-11-27 22:35:46,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,443 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:46,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557178827] [2019-11-27 22:35:46,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:46,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129981958] [2019-11-27 22:35:46,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,446 INFO L87 Difference]: Start difference. First operand 186 states and 287 transitions. Second operand 3 states. [2019-11-27 22:35:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,470 INFO L93 Difference]: Finished difference Result 536 states and 822 transitions. [2019-11-27 22:35:46,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-27 22:35:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,473 INFO L225 Difference]: With dead ends: 536 [2019-11-27 22:35:46,474 INFO L226 Difference]: Without dead ends: 357 [2019-11-27 22:35:46,475 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:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-27 22:35:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2019-11-27 22:35:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-27 22:35:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2019-11-27 22:35:46,492 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 26 [2019-11-27 22:35:46,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,493 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2019-11-27 22:35:46,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2019-11-27 22:35:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 22:35:46,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,494 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, 1, 1, 1, 1] [2019-11-27 22:35:46,495 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1232648243, now seen corresponding path program 1 times [2019-11-27 22:35:46,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882055169] [2019-11-27 22:35:46,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,561 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:46,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882055169] [2019-11-27 22:35:46,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:46,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611917065] [2019-11-27 22:35:46,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:46,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:46,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:46,563 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2019-11-27 22:35:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,832 INFO L93 Difference]: Finished difference Result 1099 states and 1679 transitions. [2019-11-27 22:35:46,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:46,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-27 22:35:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,839 INFO L225 Difference]: With dead ends: 1099 [2019-11-27 22:35:46,839 INFO L226 Difference]: Without dead ends: 752 [2019-11-27 22:35:46,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-11-27 22:35:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 598. [2019-11-27 22:35:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-27 22:35:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 927 transitions. [2019-11-27 22:35:46,871 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 927 transitions. Word has length 27 [2019-11-27 22:35:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,871 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 927 transitions. [2019-11-27 22:35:46,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 927 transitions. [2019-11-27 22:35:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 22:35:46,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:46,874 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707043, now seen corresponding path program 1 times [2019-11-27 22:35:46,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318537586] [2019-11-27 22:35:46,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,917 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:46,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318537586] [2019-11-27 22:35:46,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385444343] [2019-11-27 22:35:46,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,920 INFO L87 Difference]: Start difference. First operand 598 states and 927 transitions. Second operand 3 states. [2019-11-27 22:35:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,159 INFO L93 Difference]: Finished difference Result 1330 states and 2091 transitions. [2019-11-27 22:35:47,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-27 22:35:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,166 INFO L225 Difference]: With dead ends: 1330 [2019-11-27 22:35:47,166 INFO L226 Difference]: Without dead ends: 740 [2019-11-27 22:35:47,168 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:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-11-27 22:35:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 720. [2019-11-27 22:35:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-27 22:35:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1142 transitions. [2019-11-27 22:35:47,211 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1142 transitions. Word has length 41 [2019-11-27 22:35:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,212 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1142 transitions. [2019-11-27 22:35:47,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1142 transitions. [2019-11-27 22:35:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-27 22:35:47,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:47,214 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716310, now seen corresponding path program 1 times [2019-11-27 22:35:47,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186961490] [2019-11-27 22:35:47,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,252 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:47,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186961490] [2019-11-27 22:35:47,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643095559] [2019-11-27 22:35:47,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,254 INFO L87 Difference]: Start difference. First operand 720 states and 1142 transitions. Second operand 3 states. [2019-11-27 22:35:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,444 INFO L93 Difference]: Finished difference Result 1497 states and 2391 transitions. [2019-11-27 22:35:47,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-27 22:35:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,449 INFO L225 Difference]: With dead ends: 1497 [2019-11-27 22:35:47,449 INFO L226 Difference]: Without dead ends: 785 [2019-11-27 22:35:47,451 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:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-11-27 22:35:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 765. [2019-11-27 22:35:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-27 22:35:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1227 transitions. [2019-11-27 22:35:47,484 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1227 transitions. Word has length 42 [2019-11-27 22:35:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,484 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1227 transitions. [2019-11-27 22:35:47,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1227 transitions. [2019-11-27 22:35:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 22:35:47,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,486 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:35:47,486 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,487 INFO L82 PathProgramCache]: Analyzing trace with hash 477806323, now seen corresponding path program 1 times [2019-11-27 22:35:47,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446003152] [2019-11-27 22:35:47,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:47,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446003152] [2019-11-27 22:35:47,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066082325] [2019-11-27 22:35:47,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,517 INFO L87 Difference]: Start difference. First operand 765 states and 1227 transitions. Second operand 3 states. [2019-11-27 22:35:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,549 INFO L93 Difference]: Finished difference Result 1522 states and 2442 transitions. [2019-11-27 22:35:47,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-27 22:35:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,554 INFO L225 Difference]: With dead ends: 1522 [2019-11-27 22:35:47,555 INFO L226 Difference]: Without dead ends: 765 [2019-11-27 22:35:47,556 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:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-11-27 22:35:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2019-11-27 22:35:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-27 22:35:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1210 transitions. [2019-11-27 22:35:47,603 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1210 transitions. Word has length 43 [2019-11-27 22:35:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,604 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1210 transitions. [2019-11-27 22:35:47,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1210 transitions. [2019-11-27 22:35:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 22:35:47,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,608 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:35:47,608 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash -701855575, now seen corresponding path program 1 times [2019-11-27 22:35:47,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470930460] [2019-11-27 22:35:47,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:47,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470930460] [2019-11-27 22:35:47,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535802583] [2019-11-27 22:35:47,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,675 INFO L87 Difference]: Start difference. First operand 765 states and 1210 transitions. Second operand 3 states. [2019-11-27 22:35:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,731 INFO L93 Difference]: Finished difference Result 1536 states and 2425 transitions. [2019-11-27 22:35:47,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-27 22:35:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,737 INFO L225 Difference]: With dead ends: 1536 [2019-11-27 22:35:47,737 INFO L226 Difference]: Without dead ends: 779 [2019-11-27 22:35:47,739 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:47,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-27 22:35:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2019-11-27 22:35:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-27 22:35:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1208 transitions. [2019-11-27 22:35:47,794 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1208 transitions. Word has length 44 [2019-11-27 22:35:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,794 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1208 transitions. [2019-11-27 22:35:47,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1208 transitions. [2019-11-27 22:35:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-27 22:35:47,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,798 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:35:47,798 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,799 INFO L82 PathProgramCache]: Analyzing trace with hash 616075766, now seen corresponding path program 1 times [2019-11-27 22:35:47,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984944088] [2019-11-27 22:35:47,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:47,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984944088] [2019-11-27 22:35:47,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:47,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961102139] [2019-11-27 22:35:47,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,854 INFO L87 Difference]: Start difference. First operand 777 states and 1208 transitions. Second operand 3 states. [2019-11-27 22:35:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,935 INFO L93 Difference]: Finished difference Result 2298 states and 3572 transitions. [2019-11-27 22:35:47,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-27 22:35:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,948 INFO L225 Difference]: With dead ends: 2298 [2019-11-27 22:35:47,949 INFO L226 Difference]: Without dead ends: 1529 [2019-11-27 22:35:47,952 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:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2019-11-27 22:35:48,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1217. [2019-11-27 22:35:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-27 22:35:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1884 transitions. [2019-11-27 22:35:48,034 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1884 transitions. Word has length 49 [2019-11-27 22:35:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,035 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1884 transitions. [2019-11-27 22:35:48,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1884 transitions. [2019-11-27 22:35:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-27 22:35:48,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,038 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:35:48,038 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1509562104, now seen corresponding path program 1 times [2019-11-27 22:35:48,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705691736] [2019-11-27 22:35:48,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:48,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705691736] [2019-11-27 22:35:48,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:48,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583393988] [2019-11-27 22:35:48,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,081 INFO L87 Difference]: Start difference. First operand 1217 states and 1884 transitions. Second operand 3 states. [2019-11-27 22:35:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,301 INFO L93 Difference]: Finished difference Result 2638 states and 4072 transitions. [2019-11-27 22:35:48,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-27 22:35:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,310 INFO L225 Difference]: With dead ends: 2638 [2019-11-27 22:35:48,310 INFO L226 Difference]: Without dead ends: 1430 [2019-11-27 22:35:48,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-11-27 22:35:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1324. [2019-11-27 22:35:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-11-27 22:35:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1999 transitions. [2019-11-27 22:35:48,389 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1999 transitions. Word has length 49 [2019-11-27 22:35:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,390 INFO L462 AbstractCegarLoop]: Abstraction has 1324 states and 1999 transitions. [2019-11-27 22:35:48,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1999 transitions. [2019-11-27 22:35:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-27 22:35:48,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,393 INFO L410 BasicCegarLoop]: trace histogram [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:48,394 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash 531471331, now seen corresponding path program 1 times [2019-11-27 22:35:48,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774214142] [2019-11-27 22:35:48,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:35:48,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774214142] [2019-11-27 22:35:48,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:48,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731327194] [2019-11-27 22:35:48,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,442 INFO L87 Difference]: Start difference. First operand 1324 states and 1999 transitions. Second operand 3 states. [2019-11-27 22:35:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,515 INFO L93 Difference]: Finished difference Result 2486 states and 3735 transitions. [2019-11-27 22:35:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-27 22:35:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,525 INFO L225 Difference]: With dead ends: 2486 [2019-11-27 22:35:48,526 INFO L226 Difference]: Without dead ends: 1659 [2019-11-27 22:35:48,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-11-27 22:35:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1185. [2019-11-27 22:35:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-11-27 22:35:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1780 transitions. [2019-11-27 22:35:48,608 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1780 transitions. Word has length 54 [2019-11-27 22:35:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,608 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1780 transitions. [2019-11-27 22:35:48,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1780 transitions. [2019-11-27 22:35:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-27 22:35:48,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,611 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:35:48,612 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1599732210, now seen corresponding path program 1 times [2019-11-27 22:35:48,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36121509] [2019-11-27 22:35:48,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:48,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36121509] [2019-11-27 22:35:48,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:48,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503912279] [2019-11-27 22:35:48,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,657 INFO L87 Difference]: Start difference. First operand 1185 states and 1780 transitions. Second operand 3 states. [2019-11-27 22:35:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,743 INFO L93 Difference]: Finished difference Result 3421 states and 5102 transitions. [2019-11-27 22:35:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-27 22:35:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,755 INFO L225 Difference]: With dead ends: 3421 [2019-11-27 22:35:48,756 INFO L226 Difference]: Without dead ends: 2245 [2019-11-27 22:35:48,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-11-27 22:35:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2243. [2019-11-27 22:35:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-11-27 22:35:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3304 transitions. [2019-11-27 22:35:48,854 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3304 transitions. Word has length 55 [2019-11-27 22:35:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,854 INFO L462 AbstractCegarLoop]: Abstraction has 2243 states and 3304 transitions. [2019-11-27 22:35:48,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3304 transitions. [2019-11-27 22:35:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-27 22:35:48,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,859 INFO L410 BasicCegarLoop]: trace histogram [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:48,860 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1445576834, now seen corresponding path program 1 times [2019-11-27 22:35:48,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100563848] [2019-11-27 22:35:48,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:48,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:35:48,917 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:35:48,966 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,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:48,966 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:48,966 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:48,967 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:48,967 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:44" (3/4) ... [2019-11-27 22:35:48,970 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:35:49,048 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:49,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:49,050 INFO L168 Benchmark]: Toolchain (without parser) took 6277.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.8 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -242.7 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,051 INFO L168 Benchmark]: CDTParser took 0.33 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:49,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.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:49,052 INFO L168 Benchmark]: Boogie Preprocessor took 49.43 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:49,053 INFO L168 Benchmark]: RCFGBuilder took 883.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,053 INFO L168 Benchmark]: TraceAbstraction took 4705.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -154.9 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,054 INFO L168 Benchmark]: Witness Printer took 82.01 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,056 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.33 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 492.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.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. * Boogie Preprocessor took 49.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 883.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4705.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -154.9 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * Witness Printer took 82.01 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 640]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L645] int s ; [L646] int tmp ; [L650] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__s3__tmp__reuse_message = 0 [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND FALSE !(state == 8496) [L614] COND FALSE !(\read(s__debug)) [L620] COND TRUE cb != 0 [L621] COND TRUE s__state != state [L622] new_state = s__state [L623] s__state = state [L624] s__state = new_state [L629] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 [L297] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND TRUE state == 8496 [L640] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.5s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3434 SDtfs, 3298 SDslu, 1317 SDs, 0 SdLazy, 1077 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2243occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1140 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 70785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 102/102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...