./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9ebacab53db4f4e6d9f51b7145688401913e247 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:40:47,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:40:47,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:40:47,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:40:47,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:40:47,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:40:47,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:40:47,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:40:47,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:40:47,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:40:47,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:40:47,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:40:47,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:40:47,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:40:47,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:40:47,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:40:47,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:40:47,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:40:47,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:40:47,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:40:47,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:40:47,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:40:47,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:40:47,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:40:47,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:40:47,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:40:47,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:40:47,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:40:47,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:40:47,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:40:47,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:40:47,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:40:47,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:40:47,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:40:47,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:40:47,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:40:47,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:40:47,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:40:47,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:40:47,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:40:47,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:40:47,524 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:40:47,536 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:40:47,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:40:47,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:40:47,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:40:47,542 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:40:47,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:40:47,542 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:40:47,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:40:47,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:40:47,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:40:47,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:40:47,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:40:47,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:40:47,545 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:40:47,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:40:47,545 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:40:47,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:40:47,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:40:47,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:40:47,546 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:40:47,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:40:47,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:40:47,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:40:47,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:40:47,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:40:47,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:40:47,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:40:47,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:40:47,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9ebacab53db4f4e6d9f51b7145688401913e247 [2019-11-15 22:40:47,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:40:47,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:40:47,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:40:47,598 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:40:47,599 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:40:47,600 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-15 22:40:47,658 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/data/ce9316a26/687faad938744b35b546eda393cdabed/FLAG665b1f97f [2019-11-15 22:40:48,056 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:40:48,057 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-15 22:40:48,067 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/data/ce9316a26/687faad938744b35b546eda393cdabed/FLAG665b1f97f [2019-11-15 22:40:48,079 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/data/ce9316a26/687faad938744b35b546eda393cdabed [2019-11-15 22:40:48,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:40:48,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:40:48,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:40:48,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:40:48,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:40:48,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0c5f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48, skipping insertion in model container [2019-11-15 22:40:48,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,096 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:40:48,131 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:40:48,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:40:48,411 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:40:48,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:40:48,484 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:40:48,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48 WrapperNode [2019-11-15 22:40:48,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:40:48,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:40:48,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:40:48,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:40:48,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:40:48,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:40:48,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:40:48,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:40:48,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (1/1) ... [2019-11-15 22:40:48,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:40:48,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:40:48,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:40:48,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:40:48,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:40:48,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:40:48,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:40:48,832 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:40:49,508 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 22:40:49,509 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 22:40:49,510 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:40:49,511 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:40:49,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:40:49 BoogieIcfgContainer [2019-11-15 22:40:49,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:40:49,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:40:49,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:40:49,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:40:49,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:40:48" (1/3) ... [2019-11-15 22:40:49,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533e1c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:40:49, skipping insertion in model container [2019-11-15 22:40:49,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:48" (2/3) ... [2019-11-15 22:40:49,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533e1c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:40:49, skipping insertion in model container [2019-11-15 22:40:49,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:40:49" (3/3) ... [2019-11-15 22:40:49,519 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-11-15 22:40:49,527 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:40:49,534 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:40:49,543 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:40:49,571 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:40:49,571 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:40:49,571 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:40:49,572 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:40:49,572 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:40:49,572 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:40:49,572 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:40:49,572 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:40:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-11-15 22:40:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:40:49,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:49,597 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:49,599 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:49,604 INFO L82 PathProgramCache]: Analyzing trace with hash 837253908, now seen corresponding path program 1 times [2019-11-15 22:40:49,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:49,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488712023] [2019-11-15 22:40:49,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:49,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:49,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:49,791 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-15 22:40:49,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488712023] [2019-11-15 22:40:49,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:49,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:49,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414413275] [2019-11-15 22:40:49,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:49,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:49,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:49,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:49,807 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 3 states. [2019-11-15 22:40:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:50,108 INFO L93 Difference]: Finished difference Result 352 states and 612 transitions. [2019-11-15 22:40:50,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:50,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 22:40:50,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:50,122 INFO L225 Difference]: With dead ends: 352 [2019-11-15 22:40:50,122 INFO L226 Difference]: Without dead ends: 173 [2019-11-15 22:40:50,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-15 22:40:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-11-15 22:40:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 22:40:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-11-15 22:40:50,173 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 27 [2019-11-15 22:40:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:50,174 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-11-15 22:40:50,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-11-15 22:40:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:40:50,176 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:50,176 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:50,177 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:50,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:50,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1153856875, now seen corresponding path program 1 times [2019-11-15 22:40:50,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:50,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016826660] [2019-11-15 22:40:50,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:50,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:50,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:50,223 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-15 22:40:50,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016826660] [2019-11-15 22:40:50,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:50,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:50,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094354569] [2019-11-15 22:40:50,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:50,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:50,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:50,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:50,226 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 3 states. [2019-11-15 22:40:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:50,411 INFO L93 Difference]: Finished difference Result 357 states and 574 transitions. [2019-11-15 22:40:50,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:50,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 22:40:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:50,414 INFO L225 Difference]: With dead ends: 357 [2019-11-15 22:40:50,414 INFO L226 Difference]: Without dead ends: 193 [2019-11-15 22:40:50,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-15 22:40:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-15 22:40:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-15 22:40:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2019-11-15 22:40:50,431 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 28 [2019-11-15 22:40:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:50,431 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2019-11-15 22:40:50,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2019-11-15 22:40:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:40:50,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:50,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:50,433 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1283716064, now seen corresponding path program 1 times [2019-11-15 22:40:50,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:50,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219898123] [2019-11-15 22:40:50,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:50,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:50,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:50,493 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-15 22:40:50,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219898123] [2019-11-15 22:40:50,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:50,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:50,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397884612] [2019-11-15 22:40:50,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:50,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:50,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:50,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:50,495 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand 3 states. [2019-11-15 22:40:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:50,665 INFO L93 Difference]: Finished difference Result 387 states and 615 transitions. [2019-11-15 22:40:50,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:50,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 22:40:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:50,668 INFO L225 Difference]: With dead ends: 387 [2019-11-15 22:40:50,668 INFO L226 Difference]: Without dead ends: 201 [2019-11-15 22:40:50,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-15 22:40:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-11-15 22:40:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-15 22:40:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2019-11-15 22:40:50,694 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 28 [2019-11-15 22:40:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:50,694 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2019-11-15 22:40:50,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2019-11-15 22:40:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:40:50,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:50,698 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:50,698 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1700322528, now seen corresponding path program 1 times [2019-11-15 22:40:50,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:50,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127541402] [2019-11-15 22:40:50,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:50,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:50,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:50,782 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-15 22:40:50,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127541402] [2019-11-15 22:40:50,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:50,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:50,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076932341] [2019-11-15 22:40:50,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:50,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:50,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:50,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:50,785 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand 3 states. [2019-11-15 22:40:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:50,947 INFO L93 Difference]: Finished difference Result 392 states and 625 transitions. [2019-11-15 22:40:50,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:50,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 22:40:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:50,949 INFO L225 Difference]: With dead ends: 392 [2019-11-15 22:40:50,949 INFO L226 Difference]: Without dead ends: 200 [2019-11-15 22:40:50,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-15 22:40:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-11-15 22:40:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-15 22:40:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2019-11-15 22:40:50,963 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 28 [2019-11-15 22:40:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:50,963 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2019-11-15 22:40:50,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2019-11-15 22:40:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:40:50,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:50,965 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:50,966 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:50,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:50,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1839049416, now seen corresponding path program 1 times [2019-11-15 22:40:50,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:50,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620278914] [2019-11-15 22:40:50,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:50,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:50,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:50,997 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-15 22:40:50,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620278914] [2019-11-15 22:40:50,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:50,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:50,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849450897] [2019-11-15 22:40:50,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:50,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:50,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:50,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:50,999 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2019-11-15 22:40:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:51,154 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2019-11-15 22:40:51,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:51,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 22:40:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:51,156 INFO L225 Difference]: With dead ends: 403 [2019-11-15 22:40:51,156 INFO L226 Difference]: Without dead ends: 210 [2019-11-15 22:40:51,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-15 22:40:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-15 22:40:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-15 22:40:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2019-11-15 22:40:51,167 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 29 [2019-11-15 22:40:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:51,167 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2019-11-15 22:40:51,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2019-11-15 22:40:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:40:51,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:51,170 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:51,170 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:51,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:51,170 INFO L82 PathProgramCache]: Analyzing trace with hash 208599556, now seen corresponding path program 1 times [2019-11-15 22:40:51,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:51,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656872285] [2019-11-15 22:40:51,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:51,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:51,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:51,204 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-15 22:40:51,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656872285] [2019-11-15 22:40:51,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:51,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:51,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650200585] [2019-11-15 22:40:51,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:51,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:51,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:51,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:51,206 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand 3 states. [2019-11-15 22:40:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:51,378 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2019-11-15 22:40:51,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:51,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-15 22:40:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:51,381 INFO L225 Difference]: With dead ends: 403 [2019-11-15 22:40:51,381 INFO L226 Difference]: Without dead ends: 210 [2019-11-15 22:40:51,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-15 22:40:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-15 22:40:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-15 22:40:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2019-11-15 22:40:51,390 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 30 [2019-11-15 22:40:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:51,390 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2019-11-15 22:40:51,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2019-11-15 22:40:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:40:51,391 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:51,392 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:51,392 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:51,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:51,392 INFO L82 PathProgramCache]: Analyzing trace with hash 317962813, now seen corresponding path program 1 times [2019-11-15 22:40:51,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:51,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216116184] [2019-11-15 22:40:51,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:51,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:51,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:51,417 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-15 22:40:51,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216116184] [2019-11-15 22:40:51,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:51,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:51,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372682742] [2019-11-15 22:40:51,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:51,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:51,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:51,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:51,419 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2019-11-15 22:40:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:51,557 INFO L93 Difference]: Finished difference Result 403 states and 629 transitions. [2019-11-15 22:40:51,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:51,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 22:40:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:51,560 INFO L225 Difference]: With dead ends: 403 [2019-11-15 22:40:51,560 INFO L226 Difference]: Without dead ends: 210 [2019-11-15 22:40:51,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-15 22:40:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-15 22:40:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-15 22:40:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2019-11-15 22:40:51,569 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 31 [2019-11-15 22:40:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:51,571 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2019-11-15 22:40:51,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2019-11-15 22:40:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:40:51,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:51,574 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:51,574 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:51,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:51,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1377718110, now seen corresponding path program 1 times [2019-11-15 22:40:51,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:51,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695435677] [2019-11-15 22:40:51,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:51,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:51,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:51,638 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-15 22:40:51,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695435677] [2019-11-15 22:40:51,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:51,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:40:51,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446599169] [2019-11-15 22:40:51,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:40:51,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:51,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:40:51,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:40:51,640 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand 4 states. [2019-11-15 22:40:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:51,915 INFO L93 Difference]: Finished difference Result 599 states and 929 transitions. [2019-11-15 22:40:51,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:40:51,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-15 22:40:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:51,919 INFO L225 Difference]: With dead ends: 599 [2019-11-15 22:40:51,919 INFO L226 Difference]: Without dead ends: 406 [2019-11-15 22:40:51,920 INFO L600 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-15 22:40:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-15 22:40:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2019-11-15 22:40:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-15 22:40:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 594 transitions. [2019-11-15 22:40:51,937 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 594 transitions. Word has length 31 [2019-11-15 22:40:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:51,938 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 594 transitions. [2019-11-15 22:40:51,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:40:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 594 transitions. [2019-11-15 22:40:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:40:51,939 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:51,939 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:51,939 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:51,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:51,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610357, now seen corresponding path program 1 times [2019-11-15 22:40:51,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:51,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336796963] [2019-11-15 22:40:51,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:51,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:51,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:51,969 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-15 22:40:51,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336796963] [2019-11-15 22:40:51,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:51,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:51,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598025583] [2019-11-15 22:40:51,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:51,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:51,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:51,971 INFO L87 Difference]: Start difference. First operand 382 states and 594 transitions. Second operand 3 states. [2019-11-15 22:40:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:52,172 INFO L93 Difference]: Finished difference Result 841 states and 1323 transitions. [2019-11-15 22:40:52,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:52,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 22:40:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:52,175 INFO L225 Difference]: With dead ends: 841 [2019-11-15 22:40:52,175 INFO L226 Difference]: Without dead ends: 466 [2019-11-15 22:40:52,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-15 22:40:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 448. [2019-11-15 22:40:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-15 22:40:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 709 transitions. [2019-11-15 22:40:52,194 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 709 transitions. Word has length 43 [2019-11-15 22:40:52,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:52,195 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 709 transitions. [2019-11-15 22:40:52,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 709 transitions. [2019-11-15 22:40:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 22:40:52,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:52,196 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:52,196 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash -918181316, now seen corresponding path program 1 times [2019-11-15 22:40:52,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:52,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269231348] [2019-11-15 22:40:52,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:52,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:52,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:52,224 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-15 22:40:52,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269231348] [2019-11-15 22:40:52,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:52,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:52,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455883710] [2019-11-15 22:40:52,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:52,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:52,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:52,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:52,225 INFO L87 Difference]: Start difference. First operand 448 states and 709 transitions. Second operand 3 states. [2019-11-15 22:40:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:52,425 INFO L93 Difference]: Finished difference Result 930 states and 1481 transitions. [2019-11-15 22:40:52,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:52,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 22:40:52,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:52,429 INFO L225 Difference]: With dead ends: 930 [2019-11-15 22:40:52,429 INFO L226 Difference]: Without dead ends: 489 [2019-11-15 22:40:52,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-15 22:40:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2019-11-15 22:40:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-15 22:40:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 752 transitions. [2019-11-15 22:40:52,449 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 752 transitions. Word has length 44 [2019-11-15 22:40:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:52,449 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 752 transitions. [2019-11-15 22:40:52,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2019-11-15 22:40:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 22:40:52,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:52,451 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:52,451 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:52,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1360549312, now seen corresponding path program 1 times [2019-11-15 22:40:52,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:52,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067731770] [2019-11-15 22:40:52,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:52,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:52,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:40:52,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067731770] [2019-11-15 22:40:52,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:52,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:52,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136275049] [2019-11-15 22:40:52,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:52,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:52,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:52,493 INFO L87 Difference]: Start difference. First operand 471 states and 752 transitions. Second operand 3 states. [2019-11-15 22:40:52,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:52,684 INFO L93 Difference]: Finished difference Result 987 states and 1577 transitions. [2019-11-15 22:40:52,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:52,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-15 22:40:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:52,688 INFO L225 Difference]: With dead ends: 987 [2019-11-15 22:40:52,689 INFO L226 Difference]: Without dead ends: 523 [2019-11-15 22:40:52,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-15 22:40:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-11-15 22:40:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-15 22:40:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 803 transitions. [2019-11-15 22:40:52,711 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 803 transitions. Word has length 55 [2019-11-15 22:40:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:52,711 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 803 transitions. [2019-11-15 22:40:52,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 803 transitions. [2019-11-15 22:40:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:40:52,713 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:52,714 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:52,714 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:52,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:52,714 INFO L82 PathProgramCache]: Analyzing trace with hash -938767092, now seen corresponding path program 1 times [2019-11-15 22:40:52,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:52,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160335278] [2019-11-15 22:40:52,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:52,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:52,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:40:52,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160335278] [2019-11-15 22:40:52,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:52,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:52,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192841972] [2019-11-15 22:40:52,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:52,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:52,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:52,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:52,786 INFO L87 Difference]: Start difference. First operand 505 states and 803 transitions. Second operand 3 states. [2019-11-15 22:40:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:52,972 INFO L93 Difference]: Finished difference Result 1021 states and 1625 transitions. [2019-11-15 22:40:52,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:52,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-15 22:40:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:52,976 INFO L225 Difference]: With dead ends: 1021 [2019-11-15 22:40:52,976 INFO L226 Difference]: Without dead ends: 523 [2019-11-15 22:40:52,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-15 22:40:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-11-15 22:40:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-15 22:40:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions. [2019-11-15 22:40:52,998 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 56 [2019-11-15 22:40:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:52,999 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 800 transitions. [2019-11-15 22:40:52,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions. [2019-11-15 22:40:53,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:40:53,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:53,000 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:53,001 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:53,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:53,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1817934782, now seen corresponding path program 1 times [2019-11-15 22:40:53,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:53,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852990043] [2019-11-15 22:40:53,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:53,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:53,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:40:53,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852990043] [2019-11-15 22:40:53,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:53,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:53,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643028103] [2019-11-15 22:40:53,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:53,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:53,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:53,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:53,042 INFO L87 Difference]: Start difference. First operand 505 states and 800 transitions. Second operand 3 states. [2019-11-15 22:40:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:53,235 INFO L93 Difference]: Finished difference Result 1068 states and 1696 transitions. [2019-11-15 22:40:53,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:53,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-15 22:40:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:53,241 INFO L225 Difference]: With dead ends: 1068 [2019-11-15 22:40:53,241 INFO L226 Difference]: Without dead ends: 570 [2019-11-15 22:40:53,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-15 22:40:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-11-15 22:40:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-11-15 22:40:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 897 transitions. [2019-11-15 22:40:53,265 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 897 transitions. Word has length 56 [2019-11-15 22:40:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:53,266 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 897 transitions. [2019-11-15 22:40:53,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 897 transitions. [2019-11-15 22:40:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 22:40:53,267 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:53,267 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:53,268 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1041214451, now seen corresponding path program 1 times [2019-11-15 22:40:53,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:53,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683020019] [2019-11-15 22:40:53,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:53,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:53,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:53,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683020019] [2019-11-15 22:40:53,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:53,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:53,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029601724] [2019-11-15 22:40:53,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:53,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:53,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:53,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:53,308 INFO L87 Difference]: Start difference. First operand 568 states and 897 transitions. Second operand 3 states. [2019-11-15 22:40:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:53,504 INFO L93 Difference]: Finished difference Result 1178 states and 1858 transitions. [2019-11-15 22:40:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:53,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-15 22:40:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:53,508 INFO L225 Difference]: With dead ends: 1178 [2019-11-15 22:40:53,509 INFO L226 Difference]: Without dead ends: 617 [2019-11-15 22:40:53,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-15 22:40:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-11-15 22:40:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-15 22:40:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2019-11-15 22:40:53,538 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 78 [2019-11-15 22:40:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:53,538 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2019-11-15 22:40:53,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2019-11-15 22:40:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 22:40:53,542 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:53,542 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:53,542 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:53,542 INFO L82 PathProgramCache]: Analyzing trace with hash 45471174, now seen corresponding path program 1 times [2019-11-15 22:40:53,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:53,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892583264] [2019-11-15 22:40:53,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:53,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:53,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:53,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892583264] [2019-11-15 22:40:53,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:53,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:53,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304234661] [2019-11-15 22:40:53,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:53,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:53,581 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 3 states. [2019-11-15 22:40:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:53,782 INFO L93 Difference]: Finished difference Result 1221 states and 1919 transitions. [2019-11-15 22:40:53,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:53,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-15 22:40:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:53,787 INFO L225 Difference]: With dead ends: 1221 [2019-11-15 22:40:53,787 INFO L226 Difference]: Without dead ends: 617 [2019-11-15 22:40:53,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-15 22:40:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-11-15 22:40:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-15 22:40:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 958 transitions. [2019-11-15 22:40:53,814 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 958 transitions. Word has length 79 [2019-11-15 22:40:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:53,814 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 958 transitions. [2019-11-15 22:40:53,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 958 transitions. [2019-11-15 22:40:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:40:53,816 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:53,816 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:53,817 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:53,817 INFO L82 PathProgramCache]: Analyzing trace with hash -998330754, now seen corresponding path program 1 times [2019-11-15 22:40:53,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:53,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152627240] [2019-11-15 22:40:53,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:53,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:53,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 22:40:53,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152627240] [2019-11-15 22:40:53,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:53,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:53,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320890251] [2019-11-15 22:40:53,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:53,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:53,849 INFO L87 Difference]: Start difference. First operand 611 states and 958 transitions. Second operand 3 states. [2019-11-15 22:40:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:54,034 INFO L93 Difference]: Finished difference Result 1217 states and 1907 transitions. [2019-11-15 22:40:54,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:54,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 22:40:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:54,038 INFO L225 Difference]: With dead ends: 1217 [2019-11-15 22:40:54,038 INFO L226 Difference]: Without dead ends: 613 [2019-11-15 22:40:54,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-15 22:40:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-11-15 22:40:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-15 22:40:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 953 transitions. [2019-11-15 22:40:54,062 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 953 transitions. Word has length 84 [2019-11-15 22:40:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:54,063 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 953 transitions. [2019-11-15 22:40:54,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 953 transitions. [2019-11-15 22:40:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:40:54,064 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:54,065 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:54,065 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:54,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:54,065 INFO L82 PathProgramCache]: Analyzing trace with hash -92645170, now seen corresponding path program 1 times [2019-11-15 22:40:54,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:54,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454671410] [2019-11-15 22:40:54,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:54,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:54,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 22:40:54,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454671410] [2019-11-15 22:40:54,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:54,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:54,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017497223] [2019-11-15 22:40:54,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:54,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:54,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:54,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:54,107 INFO L87 Difference]: Start difference. First operand 611 states and 953 transitions. Second operand 3 states. [2019-11-15 22:40:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:54,303 INFO L93 Difference]: Finished difference Result 1275 states and 1990 transitions. [2019-11-15 22:40:54,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:54,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-15 22:40:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:54,307 INFO L225 Difference]: With dead ends: 1275 [2019-11-15 22:40:54,308 INFO L226 Difference]: Without dead ends: 671 [2019-11-15 22:40:54,309 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-15 22:40:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-11-15 22:40:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-15 22:40:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 996 transitions. [2019-11-15 22:40:54,333 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 996 transitions. Word has length 92 [2019-11-15 22:40:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:54,333 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 996 transitions. [2019-11-15 22:40:54,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 996 transitions. [2019-11-15 22:40:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 22:40:54,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:54,335 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:54,335 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:54,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1567438302, now seen corresponding path program 1 times [2019-11-15 22:40:54,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:54,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990880314] [2019-11-15 22:40:54,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:54,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:54,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 22:40:54,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990880314] [2019-11-15 22:40:54,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:54,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:54,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5644225] [2019-11-15 22:40:54,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:54,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:54,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:54,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:54,365 INFO L87 Difference]: Start difference. First operand 643 states and 996 transitions. Second operand 3 states. [2019-11-15 22:40:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:54,545 INFO L93 Difference]: Finished difference Result 1307 states and 2027 transitions. [2019-11-15 22:40:54,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:54,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-15 22:40:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:54,549 INFO L225 Difference]: With dead ends: 1307 [2019-11-15 22:40:54,549 INFO L226 Difference]: Without dead ends: 671 [2019-11-15 22:40:54,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-15 22:40:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-11-15 22:40:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-15 22:40:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 990 transitions. [2019-11-15 22:40:54,576 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 990 transitions. Word has length 93 [2019-11-15 22:40:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:54,576 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 990 transitions. [2019-11-15 22:40:54,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 990 transitions. [2019-11-15 22:40:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:40:54,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:54,578 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:54,579 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1415900119, now seen corresponding path program 1 times [2019-11-15 22:40:54,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:54,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499962004] [2019-11-15 22:40:54,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:54,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:54,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 22:40:54,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499962004] [2019-11-15 22:40:54,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:54,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:54,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633185565] [2019-11-15 22:40:54,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:54,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:54,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:54,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:54,612 INFO L87 Difference]: Start difference. First operand 643 states and 990 transitions. Second operand 3 states. [2019-11-15 22:40:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:54,804 INFO L93 Difference]: Finished difference Result 1343 states and 2067 transitions. [2019-11-15 22:40:54,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:54,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 22:40:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:54,809 INFO L225 Difference]: With dead ends: 1343 [2019-11-15 22:40:54,809 INFO L226 Difference]: Without dead ends: 707 [2019-11-15 22:40:54,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-11-15 22:40:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 695. [2019-11-15 22:40:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-11-15 22:40:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1066 transitions. [2019-11-15 22:40:54,836 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1066 transitions. Word has length 99 [2019-11-15 22:40:54,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:54,837 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1066 transitions. [2019-11-15 22:40:54,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:54,837 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1066 transitions. [2019-11-15 22:40:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 22:40:54,839 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:54,839 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:54,839 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:54,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash 128670256, now seen corresponding path program 1 times [2019-11-15 22:40:54,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:54,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087944255] [2019-11-15 22:40:54,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:54,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:54,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 22:40:54,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087944255] [2019-11-15 22:40:54,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:54,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:54,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623269224] [2019-11-15 22:40:54,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:54,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:54,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:54,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:54,882 INFO L87 Difference]: Start difference. First operand 695 states and 1066 transitions. Second operand 3 states. [2019-11-15 22:40:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:55,069 INFO L93 Difference]: Finished difference Result 1400 states and 2149 transitions. [2019-11-15 22:40:55,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:55,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-15 22:40:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:55,074 INFO L225 Difference]: With dead ends: 1400 [2019-11-15 22:40:55,074 INFO L226 Difference]: Without dead ends: 708 [2019-11-15 22:40:55,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-11-15 22:40:55,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2019-11-15 22:40:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-15 22:40:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2019-11-15 22:40:55,103 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2019-11-15 22:40:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:55,103 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2019-11-15 22:40:55,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2019-11-15 22:40:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-15 22:40:55,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:55,105 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:40:55,105 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:55,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:55,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1243086285, now seen corresponding path program 1 times [2019-11-15 22:40:55,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:55,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835144517] [2019-11-15 22:40:55,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:55,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:55,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 22:40:55,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835144517] [2019-11-15 22:40:55,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:55,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:55,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484214463] [2019-11-15 22:40:55,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:55,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:55,147 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2019-11-15 22:40:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:55,319 INFO L93 Difference]: Finished difference Result 1432 states and 2191 transitions. [2019-11-15 22:40:55,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:55,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-15 22:40:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:55,324 INFO L225 Difference]: With dead ends: 1432 [2019-11-15 22:40:55,324 INFO L226 Difference]: Without dead ends: 743 [2019-11-15 22:40:55,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-15 22:40:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-11-15 22:40:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-15 22:40:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1122 transitions. [2019-11-15 22:40:55,354 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1122 transitions. Word has length 111 [2019-11-15 22:40:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:55,355 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1122 transitions. [2019-11-15 22:40:55,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1122 transitions. [2019-11-15 22:40:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 22:40:55,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:55,357 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:40:55,357 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:55,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:55,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2098703404, now seen corresponding path program 1 times [2019-11-15 22:40:55,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:55,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91561334] [2019-11-15 22:40:55,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:55,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:55,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 22:40:55,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91561334] [2019-11-15 22:40:55,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:55,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:55,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494652391] [2019-11-15 22:40:55,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:55,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:55,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:55,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:55,403 INFO L87 Difference]: Start difference. First operand 737 states and 1122 transitions. Second operand 3 states. [2019-11-15 22:40:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:55,598 INFO L93 Difference]: Finished difference Result 1473 states and 2241 transitions. [2019-11-15 22:40:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:55,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-15 22:40:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:55,603 INFO L225 Difference]: With dead ends: 1473 [2019-11-15 22:40:55,604 INFO L226 Difference]: Without dead ends: 743 [2019-11-15 22:40:55,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:55,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-15 22:40:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-11-15 22:40:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-15 22:40:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1117 transitions. [2019-11-15 22:40:55,634 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1117 transitions. Word has length 112 [2019-11-15 22:40:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:55,634 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1117 transitions. [2019-11-15 22:40:55,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1117 transitions. [2019-11-15 22:40:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-15 22:40:55,636 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:55,636 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:55,636 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:55,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash -742521014, now seen corresponding path program 1 times [2019-11-15 22:40:55,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:55,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937593349] [2019-11-15 22:40:55,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:55,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:55,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-15 22:40:55,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937593349] [2019-11-15 22:40:55,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:55,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:55,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437980016] [2019-11-15 22:40:55,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:55,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:55,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:55,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:55,671 INFO L87 Difference]: Start difference. First operand 737 states and 1117 transitions. Second operand 3 states. [2019-11-15 22:40:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:55,831 INFO L93 Difference]: Finished difference Result 1509 states and 2284 transitions. [2019-11-15 22:40:55,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:55,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-15 22:40:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:55,836 INFO L225 Difference]: With dead ends: 1509 [2019-11-15 22:40:55,836 INFO L226 Difference]: Without dead ends: 779 [2019-11-15 22:40:55,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-15 22:40:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-11-15 22:40:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-15 22:40:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1155 transitions. [2019-11-15 22:40:55,867 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1155 transitions. Word has length 114 [2019-11-15 22:40:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:55,868 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1155 transitions. [2019-11-15 22:40:55,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1155 transitions. [2019-11-15 22:40:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-15 22:40:55,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:55,870 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:55,870 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1633130946, now seen corresponding path program 1 times [2019-11-15 22:40:55,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:55,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046087196] [2019-11-15 22:40:55,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:55,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:55,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-15 22:40:55,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046087196] [2019-11-15 22:40:55,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:55,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:55,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824362209] [2019-11-15 22:40:55,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:55,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:55,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:55,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:55,933 INFO L87 Difference]: Start difference. First operand 769 states and 1155 transitions. Second operand 3 states. [2019-11-15 22:40:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:56,092 INFO L93 Difference]: Finished difference Result 1541 states and 2313 transitions. [2019-11-15 22:40:56,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:56,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-15 22:40:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:56,097 INFO L225 Difference]: With dead ends: 1541 [2019-11-15 22:40:56,097 INFO L226 Difference]: Without dead ends: 779 [2019-11-15 22:40:56,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-15 22:40:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-11-15 22:40:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-15 22:40:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1146 transitions. [2019-11-15 22:40:56,130 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1146 transitions. Word has length 115 [2019-11-15 22:40:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:56,130 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1146 transitions. [2019-11-15 22:40:56,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1146 transitions. [2019-11-15 22:40:56,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-15 22:40:56,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:56,133 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:56,133 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:56,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1432440334, now seen corresponding path program 1 times [2019-11-15 22:40:56,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:56,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132114254] [2019-11-15 22:40:56,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:56,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:56,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-15 22:40:56,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132114254] [2019-11-15 22:40:56,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:56,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:56,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566434797] [2019-11-15 22:40:56,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:56,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:56,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:56,169 INFO L87 Difference]: Start difference. First operand 769 states and 1146 transitions. Second operand 3 states. [2019-11-15 22:40:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:56,327 INFO L93 Difference]: Finished difference Result 1567 states and 2334 transitions. [2019-11-15 22:40:56,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:56,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-15 22:40:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:56,332 INFO L225 Difference]: With dead ends: 1567 [2019-11-15 22:40:56,333 INFO L226 Difference]: Without dead ends: 805 [2019-11-15 22:40:56,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-15 22:40:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-11-15 22:40:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-15 22:40:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1177 transitions. [2019-11-15 22:40:56,366 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1177 transitions. Word has length 136 [2019-11-15 22:40:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:56,367 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1177 transitions. [2019-11-15 22:40:56,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1177 transitions. [2019-11-15 22:40:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 22:40:56,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:56,369 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:56,369 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:56,370 INFO L82 PathProgramCache]: Analyzing trace with hash 700393094, now seen corresponding path program 1 times [2019-11-15 22:40:56,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:56,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057541422] [2019-11-15 22:40:56,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:56,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:56,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-15 22:40:56,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057541422] [2019-11-15 22:40:56,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:56,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:56,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658841705] [2019-11-15 22:40:56,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:56,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:56,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:56,416 INFO L87 Difference]: Start difference. First operand 797 states and 1177 transitions. Second operand 3 states. [2019-11-15 22:40:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:56,592 INFO L93 Difference]: Finished difference Result 1595 states and 2355 transitions. [2019-11-15 22:40:56,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:56,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-15 22:40:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:56,597 INFO L225 Difference]: With dead ends: 1595 [2019-11-15 22:40:56,597 INFO L226 Difference]: Without dead ends: 805 [2019-11-15 22:40:56,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-15 22:40:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-11-15 22:40:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-15 22:40:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1167 transitions. [2019-11-15 22:40:56,640 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1167 transitions. Word has length 137 [2019-11-15 22:40:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:56,641 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1167 transitions. [2019-11-15 22:40:56,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1167 transitions. [2019-11-15 22:40:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-15 22:40:56,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:56,644 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:40:56,644 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:56,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash 26936470, now seen corresponding path program 1 times [2019-11-15 22:40:56,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:56,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670031326] [2019-11-15 22:40:56,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:56,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:56,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-15 22:40:56,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670031326] [2019-11-15 22:40:56,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:56,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:56,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865062758] [2019-11-15 22:40:56,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:56,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:56,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:56,696 INFO L87 Difference]: Start difference. First operand 797 states and 1167 transitions. Second operand 3 states. [2019-11-15 22:40:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:56,921 INFO L93 Difference]: Finished difference Result 1650 states and 2409 transitions. [2019-11-15 22:40:56,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:56,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-15 22:40:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:56,926 INFO L225 Difference]: With dead ends: 1650 [2019-11-15 22:40:56,927 INFO L226 Difference]: Without dead ends: 860 [2019-11-15 22:40:56,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-11-15 22:40:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 846. [2019-11-15 22:40:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-15 22:40:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1228 transitions. [2019-11-15 22:40:56,965 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1228 transitions. Word has length 140 [2019-11-15 22:40:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:56,965 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1228 transitions. [2019-11-15 22:40:56,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1228 transitions. [2019-11-15 22:40:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 22:40:56,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:56,968 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:40:56,968 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:56,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:56,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1329151537, now seen corresponding path program 1 times [2019-11-15 22:40:56,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:56,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329327953] [2019-11-15 22:40:56,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:56,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:56,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-15 22:40:57,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329327953] [2019-11-15 22:40:57,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:57,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:57,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339853932] [2019-11-15 22:40:57,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:57,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:57,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:57,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:57,011 INFO L87 Difference]: Start difference. First operand 846 states and 1228 transitions. Second operand 3 states. [2019-11-15 22:40:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:57,204 INFO L93 Difference]: Finished difference Result 1699 states and 2467 transitions. [2019-11-15 22:40:57,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:57,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-15 22:40:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:57,209 INFO L225 Difference]: With dead ends: 1699 [2019-11-15 22:40:57,209 INFO L226 Difference]: Without dead ends: 844 [2019-11-15 22:40:57,210 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-11-15 22:40:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 830. [2019-11-15 22:40:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-15 22:40:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1205 transitions. [2019-11-15 22:40:57,246 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1205 transitions. Word has length 141 [2019-11-15 22:40:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:57,247 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1205 transitions. [2019-11-15 22:40:57,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1205 transitions. [2019-11-15 22:40:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-15 22:40:57,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:57,249 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:57,249 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:57,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1387042847, now seen corresponding path program 1 times [2019-11-15 22:40:57,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:57,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236454266] [2019-11-15 22:40:57,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:57,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:57,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:40:57,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236454266] [2019-11-15 22:40:57,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:57,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:57,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717458850] [2019-11-15 22:40:57,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:57,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:57,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:57,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:57,298 INFO L87 Difference]: Start difference. First operand 830 states and 1205 transitions. Second operand 3 states. [2019-11-15 22:40:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:57,477 INFO L93 Difference]: Finished difference Result 1665 states and 2417 transitions. [2019-11-15 22:40:57,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:57,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-15 22:40:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:57,482 INFO L225 Difference]: With dead ends: 1665 [2019-11-15 22:40:57,482 INFO L226 Difference]: Without dead ends: 842 [2019-11-15 22:40:57,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-11-15 22:40:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 830. [2019-11-15 22:40:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-15 22:40:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2019-11-15 22:40:57,521 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 145 [2019-11-15 22:40:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:57,521 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2019-11-15 22:40:57,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2019-11-15 22:40:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-15 22:40:57,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:57,524 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:57,524 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash 146712776, now seen corresponding path program 1 times [2019-11-15 22:40:57,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:57,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445623238] [2019-11-15 22:40:57,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:57,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:57,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:40:57,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445623238] [2019-11-15 22:40:57,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:57,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:40:57,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006552894] [2019-11-15 22:40:57,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:57,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:57,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:57,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:57,574 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 3 states. [2019-11-15 22:40:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:57,750 INFO L93 Difference]: Finished difference Result 1665 states and 2403 transitions. [2019-11-15 22:40:57,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:57,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-15 22:40:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:57,755 INFO L225 Difference]: With dead ends: 1665 [2019-11-15 22:40:57,755 INFO L226 Difference]: Without dead ends: 825 [2019-11-15 22:40:57,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-11-15 22:40:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2019-11-15 22:40:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 22:40:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2019-11-15 22:40:57,802 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 146 [2019-11-15 22:40:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:57,803 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2019-11-15 22:40:57,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2019-11-15 22:40:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 22:40:57,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:57,805 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:57,805 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1643771369, now seen corresponding path program 1 times [2019-11-15 22:40:57,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:57,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61790004] [2019-11-15 22:40:57,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:57,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:57,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-15 22:40:57,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61790004] [2019-11-15 22:40:57,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:57,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:40:57,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015126926] [2019-11-15 22:40:57,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:57,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:57,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:57,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:57,853 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand 3 states. [2019-11-15 22:40:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:57,920 INFO L93 Difference]: Finished difference Result 2411 states and 3459 transitions. [2019-11-15 22:40:57,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:57,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-15 22:40:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:57,930 INFO L225 Difference]: With dead ends: 2411 [2019-11-15 22:40:57,930 INFO L226 Difference]: Without dead ends: 1605 [2019-11-15 22:40:57,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-11-15 22:40:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 815. [2019-11-15 22:40:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-11-15 22:40:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1171 transitions. [2019-11-15 22:40:58,015 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1171 transitions. Word has length 153 [2019-11-15 22:40:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:58,016 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1171 transitions. [2019-11-15 22:40:58,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1171 transitions. [2019-11-15 22:40:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 22:40:58,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:58,018 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:58,019 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:58,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:58,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1697255769, now seen corresponding path program 1 times [2019-11-15 22:40:58,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:58,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924187163] [2019-11-15 22:40:58,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:58,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:58,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-15 22:40:58,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924187163] [2019-11-15 22:40:58,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:58,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:40:58,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249838405] [2019-11-15 22:40:58,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:58,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:58,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:58,085 INFO L87 Difference]: Start difference. First operand 815 states and 1171 transitions. Second operand 3 states. [2019-11-15 22:40:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:58,168 INFO L93 Difference]: Finished difference Result 2410 states and 3455 transitions. [2019-11-15 22:40:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:58,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-15 22:40:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:58,177 INFO L225 Difference]: With dead ends: 2410 [2019-11-15 22:40:58,178 INFO L226 Difference]: Without dead ends: 1602 [2019-11-15 22:40:58,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-11-15 22:40:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1600. [2019-11-15 22:40:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-11-15 22:40:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2291 transitions. [2019-11-15 22:40:58,265 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2291 transitions. Word has length 153 [2019-11-15 22:40:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:58,265 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2291 transitions. [2019-11-15 22:40:58,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2291 transitions. [2019-11-15 22:40:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-15 22:40:58,267 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:58,268 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:58,268 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1707419253, now seen corresponding path program 1 times [2019-11-15 22:40:58,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:58,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979861172] [2019-11-15 22:40:58,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:58,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:58,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-15 22:40:58,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979861172] [2019-11-15 22:40:58,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:58,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:40:58,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647746956] [2019-11-15 22:40:58,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:58,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:58,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:58,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:58,405 INFO L87 Difference]: Start difference. First operand 1600 states and 2291 transitions. Second operand 3 states. [2019-11-15 22:40:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:58,563 INFO L93 Difference]: Finished difference Result 4746 states and 6779 transitions. [2019-11-15 22:40:58,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:58,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-15 22:40:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:58,580 INFO L225 Difference]: With dead ends: 4746 [2019-11-15 22:40:58,580 INFO L226 Difference]: Without dead ends: 3153 [2019-11-15 22:40:58,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-11-15 22:40:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1600. [2019-11-15 22:40:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-11-15 22:40:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2287 transitions. [2019-11-15 22:40:58,684 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2287 transitions. Word has length 155 [2019-11-15 22:40:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:58,684 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2287 transitions. [2019-11-15 22:40:58,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2287 transitions. [2019-11-15 22:40:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 22:40:58,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:58,687 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:58,687 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash 306587411, now seen corresponding path program 1 times [2019-11-15 22:40:58,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:58,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051694431] [2019-11-15 22:40:58,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:58,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:58,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-15 22:40:58,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051694431] [2019-11-15 22:40:58,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:58,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:40:58,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336426222] [2019-11-15 22:40:58,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:40:58,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:58,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:40:58,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:58,741 INFO L87 Difference]: Start difference. First operand 1600 states and 2287 transitions. Second operand 3 states. [2019-11-15 22:40:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:58,987 INFO L93 Difference]: Finished difference Result 4786 states and 6839 transitions. [2019-11-15 22:40:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:40:58,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-15 22:40:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:59,011 INFO L225 Difference]: With dead ends: 4786 [2019-11-15 22:40:59,017 INFO L226 Difference]: Without dead ends: 3193 [2019-11-15 22:40:59,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:40:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-11-15 22:40:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2019-11-15 22:40:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2019-11-15 22:40:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4487 transitions. [2019-11-15 22:40:59,219 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4487 transitions. Word has length 156 [2019-11-15 22:40:59,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:59,219 INFO L462 AbstractCegarLoop]: Abstraction has 3191 states and 4487 transitions. [2019-11-15 22:40:59,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:40:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4487 transitions. [2019-11-15 22:40:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 22:40:59,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:59,223 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:59,223 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:59,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:59,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1260527569, now seen corresponding path program 1 times [2019-11-15 22:40:59,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:59,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114887203] [2019-11-15 22:40:59,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:59,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:59,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:40:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:40:59,371 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:40:59,371 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:40:59,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:40:59 BoogieIcfgContainer [2019-11-15 22:40:59,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:40:59,473 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:40:59,473 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:40:59,473 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:40:59,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:40:49" (3/4) ... [2019-11-15 22:40:59,476 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:40:59,638 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_74d78524-a994-4eb5-a9bb-1dfcb330cf0a/bin/uautomizer/witness.graphml [2019-11-15 22:40:59,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:40:59,641 INFO L168 Benchmark]: Toolchain (without parser) took 11557.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.0 MB). Free memory was 946.1 MB in the beginning and 857.8 MB in the end (delta: 88.2 MB). Peak memory consumption was 433.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:40:59,641 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:40:59,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:40:59,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:40:59,643 INFO L168 Benchmark]: Boogie Preprocessor took 39.38 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-15 22:40:59,643 INFO L168 Benchmark]: RCFGBuilder took 927.27 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: 68.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:40:59,644 INFO L168 Benchmark]: TraceAbstraction took 9959.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 880.7 MB in the end (delta: 175.2 MB). Peak memory consumption was 380.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:40:59,644 INFO L168 Benchmark]: Witness Printer took 165.61 ms. Allocated memory is still 1.4 GB. Free memory was 880.7 MB in the beginning and 857.8 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:40:59,646 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.38 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 927.27 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: 68.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9959.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 880.7 MB in the end (delta: 175.2 MB). Peak memory consumption was 380.2 MB. Max. memory is 11.5 GB. * Witness Printer took 165.61 ms. Allocated memory is still 1.4 GB. Free memory was 880.7 MB in the beginning and 857.8 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 697]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L702] int s ; [L703] int tmp ; [L707] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND FALSE !(tmp___1 + 12288) [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L303] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L304] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L305] COND TRUE __cil_tmp56 + 256UL [L306] __cil_tmp56 = 256345 [L307] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L361] ret = __VERIFIER_nondet_int() [L362] COND FALSE !(blastFlag == 3) [L365] COND FALSE !(ret <= 0) [L382] s__state = 8544 [L383] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L387] COND TRUE s__verify_mode + 1 [L388] COND TRUE s__session__peer != 0 [L389] COND TRUE s__verify_mode + 4 [L390] s__verify_mode = 123 [L391] skip = 1 [L392] s__s3__tmp__cert_request = 0 [L393] s__state = 8560 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND TRUE s__state == 8560 [L437] ret = __VERIFIER_nondet_int() [L438] COND FALSE !(ret <= 0) [L441] s__s3__tmp__next_state___0 = 8576 [L442] s__state = 8448 [L443] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND TRUE ! s__s3__tmp__reuse_message [L653] COND TRUE ! skip [L654] COND TRUE state == 8560 [L655] COND TRUE s__state == 8448 [L656] COND TRUE s__verify_mode != -1 [L657] COND TRUE s__verify_mode != -2 [L658] COND TRUE __cil_tmp61 != 9021 [L659] COND TRUE __cil_tmp58 != 4294967294 [L660] COND TRUE blastFlag != 4 [L661] COND TRUE tmp___7 != 1024 [L697] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.8s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7083 SDtfs, 6887 SDslu, 1778 SDs, 0 SdLazy, 2873 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3191occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 567746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 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...