./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10.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_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/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 0f7b0b589689413087c164ce10eb80c902ee4046 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:38:00,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:38:00,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:38:00,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:38:00,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:38:00,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:38:00,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:38:00,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:38:00,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:38:00,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:38:00,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:38:00,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:38:00,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:38:00,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:38:00,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:38:00,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:38:00,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:38:00,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:38:00,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:38:00,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:38:00,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:38:00,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:38:00,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:38:00,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:38:00,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:38:00,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:38:00,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:38:00,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:38:00,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:38:00,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:38:00,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:38:00,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:38:00,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:38:00,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:38:00,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:38:00,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:38:00,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:38:00,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:38:00,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:38:00,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:38:00,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:38:00,443 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:38:00,469 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:38:00,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:38:00,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:38:00,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:38:00,471 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:38:00,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:38:00,471 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:38:00,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:38:00,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:38:00,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:38:00,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:38:00,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:38:00,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:38:00,473 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:38:00,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:38:00,473 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:38:00,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:38:00,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:38:00,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:38:00,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:38:00,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:38:00,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:38:00,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:38:00,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:38:00,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:38:00,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:38:00,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:38:00,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:38:00,476 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_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2019-11-15 20:38:00,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:38:00,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:38:00,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:38:00,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:38:00,524 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:38:00,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_10.c [2019-11-15 20:38:00,577 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/data/a249c0ecd/b113ee5cf5e541578f6bcd4e1e4dc1a9/FLAG55479a1f0 [2019-11-15 20:38:00,998 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:38:01,003 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/sv-benchmarks/c/locks/test_locks_10.c [2019-11-15 20:38:01,012 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/data/a249c0ecd/b113ee5cf5e541578f6bcd4e1e4dc1a9/FLAG55479a1f0 [2019-11-15 20:38:01,351 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/data/a249c0ecd/b113ee5cf5e541578f6bcd4e1e4dc1a9 [2019-11-15 20:38:01,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:38:01,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:38:01,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:38:01,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:38:01,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:38:01,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5163ed1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01, skipping insertion in model container [2019-11-15 20:38:01,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,369 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:38:01,396 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:38:01,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:38:01,681 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:38:01,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:38:01,713 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:38:01,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01 WrapperNode [2019-11-15 20:38:01,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:38:01,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:38:01,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:38:01,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:38:01,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:38:01,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:38:01,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:38:01,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:38:01,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (1/1) ... [2019-11-15 20:38:01,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:38:01,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:38:01,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:38:01,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:38:01,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/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 20:38:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:38:01,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:38:02,098 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:38:02,099 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 20:38:02,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:38:02 BoogieIcfgContainer [2019-11-15 20:38:02,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:38:02,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:38:02,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:38:02,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:38:02,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:38:01" (1/3) ... [2019-11-15 20:38:02,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e8edc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:38:02, skipping insertion in model container [2019-11-15 20:38:02,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:01" (2/3) ... [2019-11-15 20:38:02,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e8edc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:38:02, skipping insertion in model container [2019-11-15 20:38:02,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:38:02" (3/3) ... [2019-11-15 20:38:02,107 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-11-15 20:38:02,115 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:38:02,121 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:38:02,131 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:38:02,150 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:38:02,150 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:38:02,150 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:38:02,150 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:38:02,151 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:38:02,151 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:38:02,151 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:38:02,151 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:38:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-11-15 20:38:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:38:02,168 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:02,169 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:02,170 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash -977352837, now seen corresponding path program 1 times [2019-11-15 20:38:02,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:02,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200886377] [2019-11-15 20:38:02,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:02,322 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 20:38:02,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200886377] [2019-11-15 20:38:02,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:02,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:02,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65313970] [2019-11-15 20:38:02,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:02,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:02,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:02,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:02,337 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2019-11-15 20:38:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:02,391 INFO L93 Difference]: Finished difference Result 82 states and 144 transitions. [2019-11-15 20:38:02,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:02,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-15 20:38:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:02,419 INFO L225 Difference]: With dead ends: 82 [2019-11-15 20:38:02,419 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 20:38:02,422 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 20:38:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 20:38:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-11-15 20:38:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 20:38:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2019-11-15 20:38:02,465 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 85 transitions. Word has length 16 [2019-11-15 20:38:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:02,465 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 85 transitions. [2019-11-15 20:38:02,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2019-11-15 20:38:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:38:02,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:02,466 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:02,467 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1564158851, now seen corresponding path program 1 times [2019-11-15 20:38:02,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:02,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609847485] [2019-11-15 20:38:02,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:02,553 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 20:38:02,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609847485] [2019-11-15 20:38:02,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:02,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:02,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311983484] [2019-11-15 20:38:02,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:02,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:02,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:02,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:02,556 INFO L87 Difference]: Start difference. First operand 46 states and 85 transitions. Second operand 3 states. [2019-11-15 20:38:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:02,579 INFO L93 Difference]: Finished difference Result 113 states and 208 transitions. [2019-11-15 20:38:02,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:02,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-15 20:38:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:02,581 INFO L225 Difference]: With dead ends: 113 [2019-11-15 20:38:02,581 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 20:38:02,582 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 20:38:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 20:38:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-15 20:38:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 20:38:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-11-15 20:38:02,590 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 16 [2019-11-15 20:38:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:02,591 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-11-15 20:38:02,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-11-15 20:38:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 20:38:02,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:02,592 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:02,592 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:02,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:02,593 INFO L82 PathProgramCache]: Analyzing trace with hash -232953528, now seen corresponding path program 1 times [2019-11-15 20:38:02,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:02,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465570916] [2019-11-15 20:38:02,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:02,629 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 20:38:02,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465570916] [2019-11-15 20:38:02,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:02,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:02,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489885468] [2019-11-15 20:38:02,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:02,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:02,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:02,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:02,631 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-11-15 20:38:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:02,653 INFO L93 Difference]: Finished difference Result 104 states and 185 transitions. [2019-11-15 20:38:02,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:02,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-15 20:38:02,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:02,655 INFO L225 Difference]: With dead ends: 104 [2019-11-15 20:38:02,655 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 20:38:02,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 20:38:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-11-15 20:38:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-15 20:38:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 123 transitions. [2019-11-15 20:38:02,663 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 123 transitions. Word has length 17 [2019-11-15 20:38:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:02,663 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 123 transitions. [2019-11-15 20:38:02,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2019-11-15 20:38:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 20:38:02,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:02,665 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:02,665 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:02,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:02,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1244070778, now seen corresponding path program 1 times [2019-11-15 20:38:02,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:02,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212616774] [2019-11-15 20:38:02,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:02,705 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 20:38:02,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212616774] [2019-11-15 20:38:02,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:02,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:02,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666741470] [2019-11-15 20:38:02,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:02,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:02,707 INFO L87 Difference]: Start difference. First operand 69 states and 123 transitions. Second operand 3 states. [2019-11-15 20:38:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:02,723 INFO L93 Difference]: Finished difference Result 132 states and 236 transitions. [2019-11-15 20:38:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:02,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-15 20:38:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:02,726 INFO L225 Difference]: With dead ends: 132 [2019-11-15 20:38:02,726 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 20:38:02,726 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 20:38:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 20:38:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2019-11-15 20:38:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 20:38:02,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2019-11-15 20:38:02,735 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 17 [2019-11-15 20:38:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:02,736 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2019-11-15 20:38:02,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2019-11-15 20:38:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 20:38:02,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:02,737 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:02,737 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:02,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:02,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1830876792, now seen corresponding path program 1 times [2019-11-15 20:38:02,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:02,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839151296] [2019-11-15 20:38:02,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:02,768 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 20:38:02,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839151296] [2019-11-15 20:38:02,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:02,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:02,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776741099] [2019-11-15 20:38:02,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:02,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:02,770 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand 3 states. [2019-11-15 20:38:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:02,799 INFO L93 Difference]: Finished difference Result 220 states and 394 transitions. [2019-11-15 20:38:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:02,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-15 20:38:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:02,804 INFO L225 Difference]: With dead ends: 220 [2019-11-15 20:38:02,804 INFO L226 Difference]: Without dead ends: 132 [2019-11-15 20:38:02,805 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 20:38:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-15 20:38:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-11-15 20:38:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 20:38:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 230 transitions. [2019-11-15 20:38:02,814 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 230 transitions. Word has length 17 [2019-11-15 20:38:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:02,814 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 230 transitions. [2019-11-15 20:38:02,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 230 transitions. [2019-11-15 20:38:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:38:02,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:02,815 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:02,816 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:02,816 INFO L82 PathProgramCache]: Analyzing trace with hash 88725234, now seen corresponding path program 1 times [2019-11-15 20:38:02,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:02,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538074352] [2019-11-15 20:38:02,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:02,888 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 20:38:02,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538074352] [2019-11-15 20:38:02,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:02,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:02,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243351755] [2019-11-15 20:38:02,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:02,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:02,890 INFO L87 Difference]: Start difference. First operand 130 states and 230 transitions. Second operand 3 states. [2019-11-15 20:38:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:02,917 INFO L93 Difference]: Finished difference Result 197 states and 345 transitions. [2019-11-15 20:38:02,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:02,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 20:38:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:02,920 INFO L225 Difference]: With dead ends: 197 [2019-11-15 20:38:02,920 INFO L226 Difference]: Without dead ends: 134 [2019-11-15 20:38:02,921 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 20:38:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-15 20:38:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-11-15 20:38:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 20:38:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 230 transitions. [2019-11-15 20:38:02,938 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 230 transitions. Word has length 18 [2019-11-15 20:38:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:02,938 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 230 transitions. [2019-11-15 20:38:02,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 230 transitions. [2019-11-15 20:38:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:38:02,939 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:02,939 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:02,939 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash -922392016, now seen corresponding path program 1 times [2019-11-15 20:38:02,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:02,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570227470] [2019-11-15 20:38:02,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:02,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:02,980 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 20:38:02,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570227470] [2019-11-15 20:38:02,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:02,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:02,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427563008] [2019-11-15 20:38:02,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:02,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:02,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:02,982 INFO L87 Difference]: Start difference. First operand 132 states and 230 transitions. Second operand 3 states. [2019-11-15 20:38:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,003 INFO L93 Difference]: Finished difference Result 380 states and 664 transitions. [2019-11-15 20:38:03,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 20:38:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,005 INFO L225 Difference]: With dead ends: 380 [2019-11-15 20:38:03,006 INFO L226 Difference]: Without dead ends: 254 [2019-11-15 20:38:03,007 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 20:38:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-15 20:38:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-15 20:38:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 20:38:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 434 transitions. [2019-11-15 20:38:03,019 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 434 transitions. Word has length 18 [2019-11-15 20:38:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,020 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 434 transitions. [2019-11-15 20:38:03,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 434 transitions. [2019-11-15 20:38:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:38:03,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:03,021 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:03,022 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:03,022 INFO L82 PathProgramCache]: Analyzing trace with hash -335586002, now seen corresponding path program 1 times [2019-11-15 20:38:03,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:03,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926720193] [2019-11-15 20:38:03,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:03,045 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 20:38:03,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926720193] [2019-11-15 20:38:03,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:03,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:03,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434743947] [2019-11-15 20:38:03,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:03,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:03,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:03,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,047 INFO L87 Difference]: Start difference. First operand 252 states and 434 transitions. Second operand 3 states. [2019-11-15 20:38:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,061 INFO L93 Difference]: Finished difference Result 320 states and 556 transitions. [2019-11-15 20:38:03,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 20:38:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,063 INFO L225 Difference]: With dead ends: 320 [2019-11-15 20:38:03,063 INFO L226 Difference]: Without dead ends: 318 [2019-11-15 20:38:03,064 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 20:38:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-15 20:38:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 252. [2019-11-15 20:38:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 20:38:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 430 transitions. [2019-11-15 20:38:03,074 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 430 transitions. Word has length 18 [2019-11-15 20:38:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,075 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 430 transitions. [2019-11-15 20:38:03,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 430 transitions. [2019-11-15 20:38:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:38:03,076 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:03,077 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:03,077 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:03,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1470832605, now seen corresponding path program 1 times [2019-11-15 20:38:03,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:03,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623959401] [2019-11-15 20:38:03,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:03,099 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 20:38:03,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623959401] [2019-11-15 20:38:03,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:03,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:03,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704857219] [2019-11-15 20:38:03,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:03,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:03,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:03,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,101 INFO L87 Difference]: Start difference. First operand 252 states and 430 transitions. Second operand 3 states. [2019-11-15 20:38:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,125 INFO L93 Difference]: Finished difference Result 468 states and 808 transitions. [2019-11-15 20:38:03,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 20:38:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,128 INFO L225 Difference]: With dead ends: 468 [2019-11-15 20:38:03,128 INFO L226 Difference]: Without dead ends: 466 [2019-11-15 20:38:03,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-15 20:38:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 352. [2019-11-15 20:38:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-15 20:38:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 590 transitions. [2019-11-15 20:38:03,141 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 590 transitions. Word has length 19 [2019-11-15 20:38:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,142 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 590 transitions. [2019-11-15 20:38:03,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 590 transitions. [2019-11-15 20:38:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:38:03,143 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:03,144 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:03,144 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash 884026591, now seen corresponding path program 1 times [2019-11-15 20:38:03,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:03,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40845451] [2019-11-15 20:38:03,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:03,165 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 20:38:03,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40845451] [2019-11-15 20:38:03,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:03,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:03,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63026942] [2019-11-15 20:38:03,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:03,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:03,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:03,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,167 INFO L87 Difference]: Start difference. First operand 352 states and 590 transitions. Second operand 3 states. [2019-11-15 20:38:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,203 INFO L93 Difference]: Finished difference Result 836 states and 1408 transitions. [2019-11-15 20:38:03,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 20:38:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,207 INFO L225 Difference]: With dead ends: 836 [2019-11-15 20:38:03,207 INFO L226 Difference]: Without dead ends: 490 [2019-11-15 20:38:03,208 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 20:38:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-15 20:38:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2019-11-15 20:38:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-15 20:38:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 810 transitions. [2019-11-15 20:38:03,224 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 810 transitions. Word has length 19 [2019-11-15 20:38:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,224 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 810 transitions. [2019-11-15 20:38:03,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 810 transitions. [2019-11-15 20:38:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 20:38:03,225 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:03,225 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] [2019-11-15 20:38:03,226 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:03,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:03,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1648615131, now seen corresponding path program 1 times [2019-11-15 20:38:03,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:03,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858914003] [2019-11-15 20:38:03,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:38:03,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858914003] [2019-11-15 20:38:03,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:03,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:03,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020848355] [2019-11-15 20:38:03,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:03,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:03,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:03,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,259 INFO L87 Difference]: Start difference. First operand 488 states and 810 transitions. Second operand 3 states. [2019-11-15 20:38:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,280 INFO L93 Difference]: Finished difference Result 740 states and 1224 transitions. [2019-11-15 20:38:03,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 20:38:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,283 INFO L225 Difference]: With dead ends: 740 [2019-11-15 20:38:03,283 INFO L226 Difference]: Without dead ends: 502 [2019-11-15 20:38:03,284 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 20:38:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-15 20:38:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2019-11-15 20:38:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-15 20:38:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 818 transitions. [2019-11-15 20:38:03,299 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 818 transitions. Word has length 20 [2019-11-15 20:38:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,299 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 818 transitions. [2019-11-15 20:38:03,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 818 transitions. [2019-11-15 20:38:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 20:38:03,300 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:03,300 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] [2019-11-15 20:38:03,301 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:03,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:03,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1635234915, now seen corresponding path program 1 times [2019-11-15 20:38:03,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:03,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894772781] [2019-11-15 20:38:03,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:03,320 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 20:38:03,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894772781] [2019-11-15 20:38:03,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:03,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:03,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545094436] [2019-11-15 20:38:03,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:03,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:03,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,322 INFO L87 Difference]: Start difference. First operand 500 states and 818 transitions. Second operand 3 states. [2019-11-15 20:38:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,344 INFO L93 Difference]: Finished difference Result 904 states and 1500 transitions. [2019-11-15 20:38:03,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 20:38:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,350 INFO L225 Difference]: With dead ends: 904 [2019-11-15 20:38:03,350 INFO L226 Difference]: Without dead ends: 902 [2019-11-15 20:38:03,350 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 20:38:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-11-15 20:38:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 708. [2019-11-15 20:38:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-11-15 20:38:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1130 transitions. [2019-11-15 20:38:03,370 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1130 transitions. Word has length 20 [2019-11-15 20:38:03,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,371 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1130 transitions. [2019-11-15 20:38:03,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1130 transitions. [2019-11-15 20:38:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 20:38:03,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:03,372 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] [2019-11-15 20:38:03,373 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:03,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:03,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1048428901, now seen corresponding path program 1 times [2019-11-15 20:38:03,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:03,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597424584] [2019-11-15 20:38:03,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:03,390 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 20:38:03,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597424584] [2019-11-15 20:38:03,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:03,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:03,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840049721] [2019-11-15 20:38:03,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:03,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,392 INFO L87 Difference]: Start difference. First operand 708 states and 1130 transitions. Second operand 3 states. [2019-11-15 20:38:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,422 INFO L93 Difference]: Finished difference Result 1656 states and 2652 transitions. [2019-11-15 20:38:03,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 20:38:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,429 INFO L225 Difference]: With dead ends: 1656 [2019-11-15 20:38:03,429 INFO L226 Difference]: Without dead ends: 966 [2019-11-15 20:38:03,430 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 20:38:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-11-15 20:38:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2019-11-15 20:38:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-11-15 20:38:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1522 transitions. [2019-11-15 20:38:03,462 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1522 transitions. Word has length 20 [2019-11-15 20:38:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,462 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1522 transitions. [2019-11-15 20:38:03,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1522 transitions. [2019-11-15 20:38:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 20:38:03,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:03,464 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] [2019-11-15 20:38:03,464 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:03,464 INFO L82 PathProgramCache]: Analyzing trace with hash -847110476, now seen corresponding path program 1 times [2019-11-15 20:38:03,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:03,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197664546] [2019-11-15 20:38:03,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:03,500 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 20:38:03,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197664546] [2019-11-15 20:38:03,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:03,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:03,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437879203] [2019-11-15 20:38:03,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:03,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:03,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:03,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,502 INFO L87 Difference]: Start difference. First operand 964 states and 1522 transitions. Second operand 3 states. [2019-11-15 20:38:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,530 INFO L93 Difference]: Finished difference Result 1448 states and 2276 transitions. [2019-11-15 20:38:03,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 20:38:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,536 INFO L225 Difference]: With dead ends: 1448 [2019-11-15 20:38:03,536 INFO L226 Difference]: Without dead ends: 982 [2019-11-15 20:38:03,538 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 20:38:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-11-15 20:38:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2019-11-15 20:38:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-11-15 20:38:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1522 transitions. [2019-11-15 20:38:03,573 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1522 transitions. Word has length 21 [2019-11-15 20:38:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,573 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 1522 transitions. [2019-11-15 20:38:03,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1522 transitions. [2019-11-15 20:38:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 20:38:03,575 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:03,575 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] [2019-11-15 20:38:03,575 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:03,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:03,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1858227726, now seen corresponding path program 1 times [2019-11-15 20:38:03,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:03,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522259639] [2019-11-15 20:38:03,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:03,608 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 20:38:03,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522259639] [2019-11-15 20:38:03,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:03,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:03,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018128951] [2019-11-15 20:38:03,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:03,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:03,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,609 INFO L87 Difference]: Start difference. First operand 980 states and 1522 transitions. Second operand 3 states. [2019-11-15 20:38:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,644 INFO L93 Difference]: Finished difference Result 1736 states and 2740 transitions. [2019-11-15 20:38:03,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 20:38:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,655 INFO L225 Difference]: With dead ends: 1736 [2019-11-15 20:38:03,655 INFO L226 Difference]: Without dead ends: 1734 [2019-11-15 20:38:03,657 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 20:38:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-11-15 20:38:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1412. [2019-11-15 20:38:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-11-15 20:38:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2130 transitions. [2019-11-15 20:38:03,705 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2130 transitions. Word has length 21 [2019-11-15 20:38:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,705 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 2130 transitions. [2019-11-15 20:38:03,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2130 transitions. [2019-11-15 20:38:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 20:38:03,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:03,708 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] [2019-11-15 20:38:03,709 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1849933556, now seen corresponding path program 1 times [2019-11-15 20:38:03,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:03,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834771678] [2019-11-15 20:38:03,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:03,732 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 20:38:03,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834771678] [2019-11-15 20:38:03,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:03,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:03,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955389084] [2019-11-15 20:38:03,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:03,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:03,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:03,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,733 INFO L87 Difference]: Start difference. First operand 1412 states and 2130 transitions. Second operand 3 states. [2019-11-15 20:38:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,779 INFO L93 Difference]: Finished difference Result 3272 states and 4948 transitions. [2019-11-15 20:38:03,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 20:38:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,790 INFO L225 Difference]: With dead ends: 3272 [2019-11-15 20:38:03,790 INFO L226 Difference]: Without dead ends: 1894 [2019-11-15 20:38:03,792 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 20:38:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-11-15 20:38:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1892. [2019-11-15 20:38:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2019-11-15 20:38:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2818 transitions. [2019-11-15 20:38:03,853 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2818 transitions. Word has length 21 [2019-11-15 20:38:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,854 INFO L462 AbstractCegarLoop]: Abstraction has 1892 states and 2818 transitions. [2019-11-15 20:38:03,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2818 transitions. [2019-11-15 20:38:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:38:03,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:03,858 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] [2019-11-15 20:38:03,858 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:03,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1770269606, now seen corresponding path program 1 times [2019-11-15 20:38:03,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:03,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800338913] [2019-11-15 20:38:03,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:03,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:03,879 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 20:38:03,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800338913] [2019-11-15 20:38:03,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:03,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:03,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698268636] [2019-11-15 20:38:03,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:03,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:03,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:03,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:03,880 INFO L87 Difference]: Start difference. First operand 1892 states and 2818 transitions. Second operand 3 states. [2019-11-15 20:38:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:03,920 INFO L93 Difference]: Finished difference Result 2840 states and 4212 transitions. [2019-11-15 20:38:03,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:03,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 20:38:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:03,930 INFO L225 Difference]: With dead ends: 2840 [2019-11-15 20:38:03,930 INFO L226 Difference]: Without dead ends: 1926 [2019-11-15 20:38:03,932 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 20:38:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-15 20:38:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1924. [2019-11-15 20:38:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-11-15 20:38:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2818 transitions. [2019-11-15 20:38:03,996 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2818 transitions. Word has length 22 [2019-11-15 20:38:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:03,997 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 2818 transitions. [2019-11-15 20:38:03,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2818 transitions. [2019-11-15 20:38:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:38:03,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:04,000 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] [2019-11-15 20:38:04,000 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:04,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:04,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1513580440, now seen corresponding path program 1 times [2019-11-15 20:38:04,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:04,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735028458] [2019-11-15 20:38:04,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:04,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:04,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:04,024 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 20:38:04,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735028458] [2019-11-15 20:38:04,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:04,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:04,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563595929] [2019-11-15 20:38:04,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:04,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:04,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:04,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:04,025 INFO L87 Difference]: Start difference. First operand 1924 states and 2818 transitions. Second operand 3 states. [2019-11-15 20:38:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:04,102 INFO L93 Difference]: Finished difference Result 3336 states and 4964 transitions. [2019-11-15 20:38:04,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:04,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 20:38:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:04,119 INFO L225 Difference]: With dead ends: 3336 [2019-11-15 20:38:04,119 INFO L226 Difference]: Without dead ends: 3334 [2019-11-15 20:38:04,120 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 20:38:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-11-15 20:38:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2820. [2019-11-15 20:38:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2019-11-15 20:38:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4002 transitions. [2019-11-15 20:38:04,202 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4002 transitions. Word has length 22 [2019-11-15 20:38:04,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:04,202 INFO L462 AbstractCegarLoop]: Abstraction has 2820 states and 4002 transitions. [2019-11-15 20:38:04,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4002 transitions. [2019-11-15 20:38:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:38:04,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:04,206 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] [2019-11-15 20:38:04,207 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:04,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:04,207 INFO L82 PathProgramCache]: Analyzing trace with hash 926774426, now seen corresponding path program 1 times [2019-11-15 20:38:04,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:04,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041269999] [2019-11-15 20:38:04,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:04,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:04,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:04,231 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 20:38:04,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041269999] [2019-11-15 20:38:04,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:04,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:04,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738218577] [2019-11-15 20:38:04,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:04,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:04,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:04,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:04,233 INFO L87 Difference]: Start difference. First operand 2820 states and 4002 transitions. Second operand 3 states. [2019-11-15 20:38:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:04,302 INFO L93 Difference]: Finished difference Result 6472 states and 9188 transitions. [2019-11-15 20:38:04,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:04,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 20:38:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:04,321 INFO L225 Difference]: With dead ends: 6472 [2019-11-15 20:38:04,321 INFO L226 Difference]: Without dead ends: 3718 [2019-11-15 20:38:04,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-11-15 20:38:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2019-11-15 20:38:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3716 states. [2019-11-15 20:38:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 5186 transitions. [2019-11-15 20:38:04,433 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 5186 transitions. Word has length 22 [2019-11-15 20:38:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:04,433 INFO L462 AbstractCegarLoop]: Abstraction has 3716 states and 5186 transitions. [2019-11-15 20:38:04,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 5186 transitions. [2019-11-15 20:38:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 20:38:04,438 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:04,438 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:04,438 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:04,439 INFO L82 PathProgramCache]: Analyzing trace with hash -323431223, now seen corresponding path program 1 times [2019-11-15 20:38:04,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:04,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532594558] [2019-11-15 20:38:04,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:04,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:04,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:04,459 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 20:38:04,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532594558] [2019-11-15 20:38:04,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:04,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:04,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305024967] [2019-11-15 20:38:04,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:04,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:04,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:04,460 INFO L87 Difference]: Start difference. First operand 3716 states and 5186 transitions. Second operand 3 states. [2019-11-15 20:38:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:04,528 INFO L93 Difference]: Finished difference Result 5576 states and 7748 transitions. [2019-11-15 20:38:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:04,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 20:38:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:04,547 INFO L225 Difference]: With dead ends: 5576 [2019-11-15 20:38:04,548 INFO L226 Difference]: Without dead ends: 3782 [2019-11-15 20:38:04,550 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 20:38:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2019-11-15 20:38:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3780. [2019-11-15 20:38:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-11-15 20:38:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5186 transitions. [2019-11-15 20:38:04,669 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5186 transitions. Word has length 23 [2019-11-15 20:38:04,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:04,669 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 5186 transitions. [2019-11-15 20:38:04,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5186 transitions. [2019-11-15 20:38:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 20:38:04,673 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:04,673 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:04,674 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1334548473, now seen corresponding path program 1 times [2019-11-15 20:38:04,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:04,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256903242] [2019-11-15 20:38:04,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:04,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:04,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:04,695 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 20:38:04,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256903242] [2019-11-15 20:38:04,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:04,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:04,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196903604] [2019-11-15 20:38:04,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:04,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:04,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:04,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:04,696 INFO L87 Difference]: Start difference. First operand 3780 states and 5186 transitions. Second operand 3 states. [2019-11-15 20:38:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:04,798 INFO L93 Difference]: Finished difference Result 6408 states and 8900 transitions. [2019-11-15 20:38:04,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:04,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 20:38:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:04,826 INFO L225 Difference]: With dead ends: 6408 [2019-11-15 20:38:04,826 INFO L226 Difference]: Without dead ends: 6406 [2019-11-15 20:38:04,828 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 20:38:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2019-11-15 20:38:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5636. [2019-11-15 20:38:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5636 states. [2019-11-15 20:38:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 7490 transitions. [2019-11-15 20:38:04,961 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 7490 transitions. Word has length 23 [2019-11-15 20:38:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:04,961 INFO L462 AbstractCegarLoop]: Abstraction has 5636 states and 7490 transitions. [2019-11-15 20:38:04,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 7490 transitions. [2019-11-15 20:38:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 20:38:04,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:04,969 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:04,969 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:04,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:04,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1921354487, now seen corresponding path program 1 times [2019-11-15 20:38:04,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:04,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055964379] [2019-11-15 20:38:04,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:04,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:04,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:04,986 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 20:38:04,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055964379] [2019-11-15 20:38:04,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:04,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:04,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917797161] [2019-11-15 20:38:04,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:04,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:04,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:04,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:04,988 INFO L87 Difference]: Start difference. First operand 5636 states and 7490 transitions. Second operand 3 states. [2019-11-15 20:38:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:05,107 INFO L93 Difference]: Finished difference Result 12808 states and 16964 transitions. [2019-11-15 20:38:05,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:05,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 20:38:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:05,120 INFO L225 Difference]: With dead ends: 12808 [2019-11-15 20:38:05,120 INFO L226 Difference]: Without dead ends: 7302 [2019-11-15 20:38:05,127 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 20:38:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2019-11-15 20:38:05,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7300. [2019-11-15 20:38:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7300 states. [2019-11-15 20:38:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 9474 transitions. [2019-11-15 20:38:05,378 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 9474 transitions. Word has length 23 [2019-11-15 20:38:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:05,378 INFO L462 AbstractCegarLoop]: Abstraction has 7300 states and 9474 transitions. [2019-11-15 20:38:05,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 9474 transitions. [2019-11-15 20:38:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 20:38:05,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:05,387 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] [2019-11-15 20:38:05,387 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:05,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1578886031, now seen corresponding path program 1 times [2019-11-15 20:38:05,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:05,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923853993] [2019-11-15 20:38:05,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:05,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:05,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:05,412 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 20:38:05,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923853993] [2019-11-15 20:38:05,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:05,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:05,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094446341] [2019-11-15 20:38:05,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:05,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:05,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:05,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:05,414 INFO L87 Difference]: Start difference. First operand 7300 states and 9474 transitions. Second operand 3 states. [2019-11-15 20:38:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:05,509 INFO L93 Difference]: Finished difference Result 10952 states and 14148 transitions. [2019-11-15 20:38:05,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:05,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 20:38:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:05,520 INFO L225 Difference]: With dead ends: 10952 [2019-11-15 20:38:05,520 INFO L226 Difference]: Without dead ends: 7430 [2019-11-15 20:38:05,525 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 20:38:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2019-11-15 20:38:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 7428. [2019-11-15 20:38:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7428 states. [2019-11-15 20:38:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 9474 transitions. [2019-11-15 20:38:05,699 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 9474 transitions. Word has length 24 [2019-11-15 20:38:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:05,699 INFO L462 AbstractCegarLoop]: Abstraction has 7428 states and 9474 transitions. [2019-11-15 20:38:05,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 9474 transitions. [2019-11-15 20:38:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 20:38:05,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:05,707 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] [2019-11-15 20:38:05,707 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash 567768781, now seen corresponding path program 1 times [2019-11-15 20:38:05,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:05,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833419959] [2019-11-15 20:38:05,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:05,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:05,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:05,722 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 20:38:05,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833419959] [2019-11-15 20:38:05,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:05,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:05,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847468471] [2019-11-15 20:38:05,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:05,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:05,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:05,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:05,723 INFO L87 Difference]: Start difference. First operand 7428 states and 9474 transitions. Second operand 3 states. [2019-11-15 20:38:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:05,883 INFO L93 Difference]: Finished difference Result 12296 states and 15748 transitions. [2019-11-15 20:38:05,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:05,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 20:38:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:05,903 INFO L225 Difference]: With dead ends: 12296 [2019-11-15 20:38:05,903 INFO L226 Difference]: Without dead ends: 12294 [2019-11-15 20:38:05,908 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 20:38:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2019-11-15 20:38:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 11268. [2019-11-15 20:38:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2019-11-15 20:38:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 13954 transitions. [2019-11-15 20:38:06,136 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 13954 transitions. Word has length 24 [2019-11-15 20:38:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:06,136 INFO L462 AbstractCegarLoop]: Abstraction has 11268 states and 13954 transitions. [2019-11-15 20:38:06,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 13954 transitions. [2019-11-15 20:38:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 20:38:06,152 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:06,152 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] [2019-11-15 20:38:06,152 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:06,152 INFO L82 PathProgramCache]: Analyzing trace with hash -19037233, now seen corresponding path program 1 times [2019-11-15 20:38:06,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:06,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246651091] [2019-11-15 20:38:06,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:06,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:06,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:06,171 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 20:38:06,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246651091] [2019-11-15 20:38:06,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:06,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:06,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377324556] [2019-11-15 20:38:06,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:06,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:06,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:06,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:06,173 INFO L87 Difference]: Start difference. First operand 11268 states and 13954 transitions. Second operand 3 states. [2019-11-15 20:38:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:06,414 INFO L93 Difference]: Finished difference Result 25352 states and 31108 transitions. [2019-11-15 20:38:06,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:06,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 20:38:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:06,438 INFO L225 Difference]: With dead ends: 25352 [2019-11-15 20:38:06,438 INFO L226 Difference]: Without dead ends: 14342 [2019-11-15 20:38:06,452 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 20:38:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14342 states. [2019-11-15 20:38:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14342 to 14340. [2019-11-15 20:38:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-11-15 20:38:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 17154 transitions. [2019-11-15 20:38:06,877 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 17154 transitions. Word has length 24 [2019-11-15 20:38:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:06,877 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 17154 transitions. [2019-11-15 20:38:06,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 17154 transitions. [2019-11-15 20:38:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:38:06,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:06,893 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] [2019-11-15 20:38:06,893 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash 421179102, now seen corresponding path program 1 times [2019-11-15 20:38:06,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:06,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679858679] [2019-11-15 20:38:06,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:06,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:06,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:06,912 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 20:38:06,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679858679] [2019-11-15 20:38:06,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:06,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:06,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935556154] [2019-11-15 20:38:06,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:06,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:06,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:06,914 INFO L87 Difference]: Start difference. First operand 14340 states and 17154 transitions. Second operand 3 states. [2019-11-15 20:38:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:07,090 INFO L93 Difference]: Finished difference Result 21512 states and 25604 transitions. [2019-11-15 20:38:07,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:07,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 20:38:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:07,111 INFO L225 Difference]: With dead ends: 21512 [2019-11-15 20:38:07,111 INFO L226 Difference]: Without dead ends: 14598 [2019-11-15 20:38:07,122 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 20:38:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2019-11-15 20:38:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 14596. [2019-11-15 20:38:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14596 states. [2019-11-15 20:38:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14596 states to 14596 states and 17154 transitions. [2019-11-15 20:38:07,425 INFO L78 Accepts]: Start accepts. Automaton has 14596 states and 17154 transitions. Word has length 25 [2019-11-15 20:38:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:07,425 INFO L462 AbstractCegarLoop]: Abstraction has 14596 states and 17154 transitions. [2019-11-15 20:38:07,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 14596 states and 17154 transitions. [2019-11-15 20:38:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:38:07,441 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:07,441 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] [2019-11-15 20:38:07,442 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:07,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:07,442 INFO L82 PathProgramCache]: Analyzing trace with hash -589938148, now seen corresponding path program 1 times [2019-11-15 20:38:07,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:07,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216627103] [2019-11-15 20:38:07,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:07,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:07,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:07,459 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 20:38:07,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216627103] [2019-11-15 20:38:07,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:07,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:07,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452428088] [2019-11-15 20:38:07,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:07,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:07,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:07,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:07,461 INFO L87 Difference]: Start difference. First operand 14596 states and 17154 transitions. Second operand 3 states. [2019-11-15 20:38:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:07,784 INFO L93 Difference]: Finished difference Result 23558 states and 27395 transitions. [2019-11-15 20:38:07,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:07,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 20:38:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:07,815 INFO L225 Difference]: With dead ends: 23558 [2019-11-15 20:38:07,815 INFO L226 Difference]: Without dead ends: 23556 [2019-11-15 20:38:07,819 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 20:38:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23556 states. [2019-11-15 20:38:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23556 to 22532. [2019-11-15 20:38:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2019-11-15 20:38:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 25858 transitions. [2019-11-15 20:38:08,242 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 25858 transitions. Word has length 25 [2019-11-15 20:38:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:08,243 INFO L462 AbstractCegarLoop]: Abstraction has 22532 states and 25858 transitions. [2019-11-15 20:38:08,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 25858 transitions. [2019-11-15 20:38:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:38:08,273 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:08,273 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] [2019-11-15 20:38:08,273 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1176744162, now seen corresponding path program 1 times [2019-11-15 20:38:08,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:08,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138104934] [2019-11-15 20:38:08,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:08,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:08,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:08,289 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 20:38:08,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138104934] [2019-11-15 20:38:08,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:08,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:38:08,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466881491] [2019-11-15 20:38:08,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:38:08,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:08,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:38:08,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:38:08,291 INFO L87 Difference]: Start difference. First operand 22532 states and 25858 transitions. Second operand 3 states. [2019-11-15 20:38:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:38:08,600 INFO L93 Difference]: Finished difference Result 50180 states and 56578 transitions. [2019-11-15 20:38:08,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:38:08,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 20:38:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:38:08,601 INFO L225 Difference]: With dead ends: 50180 [2019-11-15 20:38:08,601 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:38:08,635 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 20:38:08,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:38:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:38:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:38:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:38:08,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-15 20:38:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:38:08,636 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:38:08,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:38:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:38:08,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:38:08,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:38:08,656 INFO L446 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-11-15 20:38:08,656 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,656 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,657 INFO L446 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-11-15 20:38:08,658 INFO L446 ceAbstractionStarter]: At program point L162(lines 4 163) the Hoare annotation is: true [2019-11-15 20:38:08,658 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 20:38:08,658 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 20:38:08,658 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-11-15 20:38:08,658 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,658 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,658 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 20:38:08,658 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 20:38:08,658 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,658 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,658 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,658 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-11-15 20:38:08,659 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 20:38:08,660 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-11-15 20:38:08,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:38:08 BoogieIcfgContainer [2019-11-15 20:38:08,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:38:08,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:38:08,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:38:08,674 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:38:08,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:38:02" (3/4) ... [2019-11-15 20:38:08,678 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:38:08,694 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 20:38:08,695 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:38:08,788 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_47d8ae4b-be2e-4c1d-b432-53bde9fc126c/bin/uautomizer/witness.graphml [2019-11-15 20:38:08,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:38:08,790 INFO L168 Benchmark]: Toolchain (without parser) took 7435.93 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 557.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -127.6 MB). Peak memory consumption was 429.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:38:08,791 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:38:08,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -252.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:38:08,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:38:08,792 INFO L168 Benchmark]: Boogie Preprocessor took 22.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:38:08,792 INFO L168 Benchmark]: RCFGBuilder took 333.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:38:08,793 INFO L168 Benchmark]: TraceAbstraction took 6573.04 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 350.7 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 95.0 MB). Peak memory consumption was 445.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:38:08,793 INFO L168 Benchmark]: Witness Printer took 114.70 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:38:08,796 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -252.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 333.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6573.04 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 350.7 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 95.0 MB). Peak memory consumption was 445.7 MB. Max. memory is 11.5 GB. * Witness Printer took 114.70 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 1 error locations. Result: SAFE, OverallTime: 6.5s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2276 SDtfs, 1149 SDslu, 1505 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22532occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1033 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 24156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...