./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14-1.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_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/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 c5a3d22d49117f02662b197492bc1b16616a2878 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:49:51,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:49:51,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:49:51,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:49:51,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:49:51,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:49:51,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:49:51,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:49:51,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:49:51,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:49:51,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:49:51,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:49:51,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:49:51,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:49:51,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:49:51,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:49:51,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:49:51,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:49:51,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:49:51,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:49:51,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:49:51,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:49:51,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:49:51,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:49:51,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:49:51,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:49:51,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:49:51,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:49:51,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:49:51,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:49:51,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:49:51,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:49:51,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:49:51,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:49:51,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:49:51,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:49:51,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:49:51,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:49:51,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:49:51,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:49:51,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:49:51,542 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:49:51,559 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:49:51,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:49:51,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:49:51,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:49:51,566 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:49:51,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:49:51,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:49:51,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:49:51,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:49:51,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:49:51,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:49:51,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:49:51,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:49:51,568 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:49:51,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:49:51,568 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:49:51,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:49:51,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:49:51,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:49:51,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:49:51,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:49:51,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:49:51,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:49:51,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:49:51,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:49:51,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:49:51,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:49:51,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:49:51,571 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_c3008143-4733-4fbd-8c7b-c9e9a141ce21/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2019-11-15 22:49:51,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:49:51,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:49:51,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:49:51,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:49:51,619 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:49:51,620 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_14-1.c [2019-11-15 22:49:51,672 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/data/2a5444e52/088aa42a4045452a897ab597fd2be57c/FLAG894b11cd2 [2019-11-15 22:49:52,053 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:49:52,053 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/sv-benchmarks/c/locks/test_locks_14-1.c [2019-11-15 22:49:52,061 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/data/2a5444e52/088aa42a4045452a897ab597fd2be57c/FLAG894b11cd2 [2019-11-15 22:49:52,075 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/data/2a5444e52/088aa42a4045452a897ab597fd2be57c [2019-11-15 22:49:52,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:49:52,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:49:52,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:49:52,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:49:52,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:49:52,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24da03c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52, skipping insertion in model container [2019-11-15 22:49:52,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,094 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:49:52,116 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:49:52,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:49:52,346 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:49:52,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:49:52,388 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:49:52,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52 WrapperNode [2019-11-15 22:49:52,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:49:52,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:49:52,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:49:52,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:49:52,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:49:52,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:49:52,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:49:52,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:49:52,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (1/1) ... [2019-11-15 22:49:52,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:49:52,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:49:52,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:49:52,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:49:52,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:49:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:49:52,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:49:53,001 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:49:53,001 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 22:49:53,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:49:53 BoogieIcfgContainer [2019-11-15 22:49:53,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:49:53,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:49:53,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:49:53,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:49:53,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:49:52" (1/3) ... [2019-11-15 22:49:53,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a2a6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:49:53, skipping insertion in model container [2019-11-15 22:49:53,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:52" (2/3) ... [2019-11-15 22:49:53,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a2a6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:49:53, skipping insertion in model container [2019-11-15 22:49:53,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:49:53" (3/3) ... [2019-11-15 22:49:53,011 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-11-15 22:49:53,020 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:49:53,031 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:49:53,043 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:49:53,073 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:49:53,073 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:49:53,073 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:49:53,074 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:49:53,074 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:49:53,074 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:49:53,074 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:49:53,076 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:49:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-11-15 22:49:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:49:53,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:53,103 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 22:49:53,106 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:53,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash 458325173, now seen corresponding path program 1 times [2019-11-15 22:49:53,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:53,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995561986] [2019-11-15 22:49:53,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:53,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995561986] [2019-11-15 22:49:53,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:53,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:53,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863837717] [2019-11-15 22:49:53,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:53,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,405 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2019-11-15 22:49:53,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:53,453 INFO L93 Difference]: Finished difference Result 106 states and 192 transitions. [2019-11-15 22:49:53,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:53,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 22:49:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:53,466 INFO L225 Difference]: With dead ends: 106 [2019-11-15 22:49:53,466 INFO L226 Difference]: Without dead ends: 92 [2019-11-15 22:49:53,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-15 22:49:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2019-11-15 22:49:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-15 22:49:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2019-11-15 22:49:53,504 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 20 [2019-11-15 22:49:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:53,505 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 117 transitions. [2019-11-15 22:49:53,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 117 transitions. [2019-11-15 22:49:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:49:53,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:53,506 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 22:49:53,506 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:53,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:53,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1130022729, now seen corresponding path program 1 times [2019-11-15 22:49:53,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:53,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433897263] [2019-11-15 22:49:53,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:53,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433897263] [2019-11-15 22:49:53,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:53,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:53,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016994065] [2019-11-15 22:49:53,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:53,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,568 INFO L87 Difference]: Start difference. First operand 62 states and 117 transitions. Second operand 3 states. [2019-11-15 22:49:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:53,593 INFO L93 Difference]: Finished difference Result 153 states and 288 transitions. [2019-11-15 22:49:53,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:53,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 22:49:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:53,596 INFO L225 Difference]: With dead ends: 153 [2019-11-15 22:49:53,596 INFO L226 Difference]: Without dead ends: 92 [2019-11-15 22:49:53,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-15 22:49:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-11-15 22:49:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 22:49:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 169 transitions. [2019-11-15 22:49:53,608 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 169 transitions. Word has length 20 [2019-11-15 22:49:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:53,609 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 169 transitions. [2019-11-15 22:49:53,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 169 transitions. [2019-11-15 22:49:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:49:53,610 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:53,610 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 22:49:53,610 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:53,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:53,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1323390526, now seen corresponding path program 1 times [2019-11-15 22:49:53,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:53,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489066674] [2019-11-15 22:49:53,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:53,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489066674] [2019-11-15 22:49:53,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:53,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:53,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143609720] [2019-11-15 22:49:53,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:53,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:53,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:53,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,659 INFO L87 Difference]: Start difference. First operand 90 states and 169 transitions. Second operand 3 states. [2019-11-15 22:49:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:53,687 INFO L93 Difference]: Finished difference Result 140 states and 257 transitions. [2019-11-15 22:49:53,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:53,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 22:49:53,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:53,690 INFO L225 Difference]: With dead ends: 140 [2019-11-15 22:49:53,690 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 22:49:53,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 22:49:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-11-15 22:49:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 22:49:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 171 transitions. [2019-11-15 22:49:53,701 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 171 transitions. Word has length 21 [2019-11-15 22:49:53,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:53,702 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 171 transitions. [2019-11-15 22:49:53,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:53,702 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2019-11-15 22:49:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:49:53,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:53,703 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 22:49:53,703 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:53,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash -670754180, now seen corresponding path program 1 times [2019-11-15 22:49:53,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:53,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223725769] [2019-11-15 22:49:53,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:53,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223725769] [2019-11-15 22:49:53,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:53,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:53,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929307929] [2019-11-15 22:49:53,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:53,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:53,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:53,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,741 INFO L87 Difference]: Start difference. First operand 93 states and 171 transitions. Second operand 3 states. [2019-11-15 22:49:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:53,770 INFO L93 Difference]: Finished difference Result 180 states and 332 transitions. [2019-11-15 22:49:53,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:53,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 22:49:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:53,773 INFO L225 Difference]: With dead ends: 180 [2019-11-15 22:49:53,773 INFO L226 Difference]: Without dead ends: 178 [2019-11-15 22:49:53,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-15 22:49:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 124. [2019-11-15 22:49:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 22:49:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 228 transitions. [2019-11-15 22:49:53,790 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 228 transitions. Word has length 21 [2019-11-15 22:49:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:53,790 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 228 transitions. [2019-11-15 22:49:53,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 228 transitions. [2019-11-15 22:49:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:49:53,792 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:53,792 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 22:49:53,792 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:53,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2035865214, now seen corresponding path program 1 times [2019-11-15 22:49:53,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:53,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582502060] [2019-11-15 22:49:53,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:53,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582502060] [2019-11-15 22:49:53,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:53,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:53,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343555751] [2019-11-15 22:49:53,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:53,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:53,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:53,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,851 INFO L87 Difference]: Start difference. First operand 124 states and 228 transitions. Second operand 3 states. [2019-11-15 22:49:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:53,878 INFO L93 Difference]: Finished difference Result 300 states and 554 transitions. [2019-11-15 22:49:53,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:53,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 22:49:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:53,881 INFO L225 Difference]: With dead ends: 300 [2019-11-15 22:49:53,881 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 22:49:53,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 22:49:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-11-15 22:49:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-15 22:49:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 326 transitions. [2019-11-15 22:49:53,898 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 326 transitions. Word has length 21 [2019-11-15 22:49:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:53,899 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 326 transitions. [2019-11-15 22:49:53,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 326 transitions. [2019-11-15 22:49:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 22:49:53,901 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:53,901 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 22:49:53,901 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:53,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:53,901 INFO L82 PathProgramCache]: Analyzing trace with hash 681669292, now seen corresponding path program 1 times [2019-11-15 22:49:53,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:53,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537591473] [2019-11-15 22:49:53,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:53,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537591473] [2019-11-15 22:49:53,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:53,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:53,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563173596] [2019-11-15 22:49:53,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:53,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:53,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:53,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,933 INFO L87 Difference]: Start difference. First operand 178 states and 326 transitions. Second operand 3 states. [2019-11-15 22:49:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:53,955 INFO L93 Difference]: Finished difference Result 269 states and 489 transitions. [2019-11-15 22:49:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:53,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 22:49:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:53,958 INFO L225 Difference]: With dead ends: 269 [2019-11-15 22:49:53,958 INFO L226 Difference]: Without dead ends: 182 [2019-11-15 22:49:53,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-15 22:49:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-11-15 22:49:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 22:49:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 326 transitions. [2019-11-15 22:49:53,973 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 326 transitions. Word has length 22 [2019-11-15 22:49:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:53,973 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 326 transitions. [2019-11-15 22:49:53,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 326 transitions. [2019-11-15 22:49:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 22:49:53,975 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:53,975 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 22:49:53,975 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:53,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:53,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1312475414, now seen corresponding path program 1 times [2019-11-15 22:49:53,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:53,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256969742] [2019-11-15 22:49:53,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:53,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:54,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256969742] [2019-11-15 22:49:54,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:54,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:54,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412070764] [2019-11-15 22:49:54,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:54,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:54,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:54,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,006 INFO L87 Difference]: Start difference. First operand 180 states and 326 transitions. Second operand 3 states. [2019-11-15 22:49:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:54,046 INFO L93 Difference]: Finished difference Result 524 states and 952 transitions. [2019-11-15 22:49:54,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:54,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 22:49:54,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:54,049 INFO L225 Difference]: With dead ends: 524 [2019-11-15 22:49:54,050 INFO L226 Difference]: Without dead ends: 350 [2019-11-15 22:49:54,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-15 22:49:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2019-11-15 22:49:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-15 22:49:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2019-11-15 22:49:54,100 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 22 [2019-11-15 22:49:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:54,100 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2019-11-15 22:49:54,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2019-11-15 22:49:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 22:49:54,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:54,103 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 22:49:54,103 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:54,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:54,103 INFO L82 PathProgramCache]: Analyzing trace with hash 275872488, now seen corresponding path program 1 times [2019-11-15 22:49:54,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:54,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369006436] [2019-11-15 22:49:54,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:54,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369006436] [2019-11-15 22:49:54,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:54,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:54,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79179907] [2019-11-15 22:49:54,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:54,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:54,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:54,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,131 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2019-11-15 22:49:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:54,147 INFO L93 Difference]: Finished difference Result 448 states and 812 transitions. [2019-11-15 22:49:54,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:54,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 22:49:54,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:54,151 INFO L225 Difference]: With dead ends: 448 [2019-11-15 22:49:54,151 INFO L226 Difference]: Without dead ends: 446 [2019-11-15 22:49:54,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-15 22:49:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 348. [2019-11-15 22:49:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-15 22:49:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 622 transitions. [2019-11-15 22:49:54,167 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 622 transitions. Word has length 22 [2019-11-15 22:49:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:54,168 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 622 transitions. [2019-11-15 22:49:54,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 622 transitions. [2019-11-15 22:49:54,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:49:54,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:54,170 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:54,170 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:54,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:54,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2031819437, now seen corresponding path program 1 times [2019-11-15 22:49:54,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:54,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910586647] [2019-11-15 22:49:54,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:54,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910586647] [2019-11-15 22:49:54,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:54,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:54,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261027238] [2019-11-15 22:49:54,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:54,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:54,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:54,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,195 INFO L87 Difference]: Start difference. First operand 348 states and 622 transitions. Second operand 3 states. [2019-11-15 22:49:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:54,220 INFO L93 Difference]: Finished difference Result 660 states and 1192 transitions. [2019-11-15 22:49:54,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:54,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 22:49:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:54,224 INFO L225 Difference]: With dead ends: 660 [2019-11-15 22:49:54,225 INFO L226 Difference]: Without dead ends: 658 [2019-11-15 22:49:54,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-11-15 22:49:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 480. [2019-11-15 22:49:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-11-15 22:49:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 846 transitions. [2019-11-15 22:49:54,245 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 846 transitions. Word has length 23 [2019-11-15 22:49:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:54,245 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 846 transitions. [2019-11-15 22:49:54,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 846 transitions. [2019-11-15 22:49:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:49:54,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:54,247 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 22:49:54,248 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:54,248 INFO L82 PathProgramCache]: Analyzing trace with hash 674799957, now seen corresponding path program 1 times [2019-11-15 22:49:54,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:54,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494629882] [2019-11-15 22:49:54,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:54,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494629882] [2019-11-15 22:49:54,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:54,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:54,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362932642] [2019-11-15 22:49:54,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:54,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:54,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,279 INFO L87 Difference]: Start difference. First operand 480 states and 846 transitions. Second operand 3 states. [2019-11-15 22:49:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:54,302 INFO L93 Difference]: Finished difference Result 1156 states and 2048 transitions. [2019-11-15 22:49:54,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:54,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 22:49:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:54,307 INFO L225 Difference]: With dead ends: 1156 [2019-11-15 22:49:54,307 INFO L226 Difference]: Without dead ends: 682 [2019-11-15 22:49:54,309 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-11-15 22:49:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-11-15 22:49:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-11-15 22:49:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1194 transitions. [2019-11-15 22:49:54,329 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1194 transitions. Word has length 23 [2019-11-15 22:49:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:54,329 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 1194 transitions. [2019-11-15 22:49:54,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1194 transitions. [2019-11-15 22:49:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:49:54,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:54,330 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 22:49:54,331 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1438319967, now seen corresponding path program 1 times [2019-11-15 22:49:54,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:54,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240100140] [2019-11-15 22:49:54,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:54,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240100140] [2019-11-15 22:49:54,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:54,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:54,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348787222] [2019-11-15 22:49:54,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:54,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:54,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,354 INFO L87 Difference]: Start difference. First operand 680 states and 1194 transitions. Second operand 3 states. [2019-11-15 22:49:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:54,374 INFO L93 Difference]: Finished difference Result 1028 states and 1800 transitions. [2019-11-15 22:49:54,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:54,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 22:49:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:54,379 INFO L225 Difference]: With dead ends: 1028 [2019-11-15 22:49:54,379 INFO L226 Difference]: Without dead ends: 694 [2019-11-15 22:49:54,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-11-15 22:49:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-11-15 22:49:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-11-15 22:49:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1202 transitions. [2019-11-15 22:49:54,402 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1202 transitions. Word has length 24 [2019-11-15 22:49:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:54,402 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 1202 transitions. [2019-11-15 22:49:54,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1202 transitions. [2019-11-15 22:49:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:49:54,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:54,404 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 22:49:54,404 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:54,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash -555824739, now seen corresponding path program 1 times [2019-11-15 22:49:54,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:54,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379014805] [2019-11-15 22:49:54,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:54,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379014805] [2019-11-15 22:49:54,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:54,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:54,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804310115] [2019-11-15 22:49:54,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:54,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:54,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:54,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,430 INFO L87 Difference]: Start difference. First operand 692 states and 1202 transitions. Second operand 3 states. [2019-11-15 22:49:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:54,459 INFO L93 Difference]: Finished difference Result 1288 states and 2268 transitions. [2019-11-15 22:49:54,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:54,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 22:49:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:54,468 INFO L225 Difference]: With dead ends: 1288 [2019-11-15 22:49:54,468 INFO L226 Difference]: Without dead ends: 1286 [2019-11-15 22:49:54,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2019-11-15 22:49:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 964. [2019-11-15 22:49:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-11-15 22:49:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1642 transitions. [2019-11-15 22:49:54,506 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1642 transitions. Word has length 24 [2019-11-15 22:49:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:54,507 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1642 transitions. [2019-11-15 22:49:54,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1642 transitions. [2019-11-15 22:49:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:49:54,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:54,509 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 22:49:54,509 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2144172641, now seen corresponding path program 1 times [2019-11-15 22:49:54,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:54,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721753461] [2019-11-15 22:49:54,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:54,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721753461] [2019-11-15 22:49:54,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:54,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:54,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380916000] [2019-11-15 22:49:54,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:54,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,543 INFO L87 Difference]: Start difference. First operand 964 states and 1642 transitions. Second operand 3 states. [2019-11-15 22:49:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:54,582 INFO L93 Difference]: Finished difference Result 2296 states and 3932 transitions. [2019-11-15 22:49:54,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:54,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 22:49:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:54,593 INFO L225 Difference]: With dead ends: 2296 [2019-11-15 22:49:54,594 INFO L226 Difference]: Without dead ends: 1350 [2019-11-15 22:49:54,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-15 22:49:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-11-15 22:49:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-11-15 22:49:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2290 transitions. [2019-11-15 22:49:54,642 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2290 transitions. Word has length 24 [2019-11-15 22:49:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:54,643 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 2290 transitions. [2019-11-15 22:49:54,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2290 transitions. [2019-11-15 22:49:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 22:49:54,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:54,646 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 22:49:54,646 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:54,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:54,647 INFO L82 PathProgramCache]: Analyzing trace with hash -50484310, now seen corresponding path program 1 times [2019-11-15 22:49:54,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:54,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577805164] [2019-11-15 22:49:54,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:54,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577805164] [2019-11-15 22:49:54,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:54,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:54,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524276635] [2019-11-15 22:49:54,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:54,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,681 INFO L87 Difference]: Start difference. First operand 1348 states and 2290 transitions. Second operand 3 states. [2019-11-15 22:49:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:54,714 INFO L93 Difference]: Finished difference Result 2024 states and 3428 transitions. [2019-11-15 22:49:54,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:54,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 22:49:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:54,723 INFO L225 Difference]: With dead ends: 2024 [2019-11-15 22:49:54,723 INFO L226 Difference]: Without dead ends: 1366 [2019-11-15 22:49:54,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-11-15 22:49:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1364. [2019-11-15 22:49:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2019-11-15 22:49:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2290 transitions. [2019-11-15 22:49:54,768 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2290 transitions. Word has length 25 [2019-11-15 22:49:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:54,769 INFO L462 AbstractCegarLoop]: Abstraction has 1364 states and 2290 transitions. [2019-11-15 22:49:54,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2290 transitions. [2019-11-15 22:49:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 22:49:54,771 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:54,771 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 22:49:54,771 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2044629016, now seen corresponding path program 1 times [2019-11-15 22:49:54,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:54,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633382870] [2019-11-15 22:49:54,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:54,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633382870] [2019-11-15 22:49:54,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:54,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:54,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41137535] [2019-11-15 22:49:54,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:54,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:54,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:54,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,800 INFO L87 Difference]: Start difference. First operand 1364 states and 2290 transitions. Second operand 3 states. [2019-11-15 22:49:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:54,837 INFO L93 Difference]: Finished difference Result 2504 states and 4276 transitions. [2019-11-15 22:49:54,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:54,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 22:49:54,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:54,852 INFO L225 Difference]: With dead ends: 2504 [2019-11-15 22:49:54,852 INFO L226 Difference]: Without dead ends: 2502 [2019-11-15 22:49:54,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-11-15 22:49:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1924. [2019-11-15 22:49:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-11-15 22:49:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3154 transitions. [2019-11-15 22:49:54,933 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3154 transitions. Word has length 25 [2019-11-15 22:49:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:54,933 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 3154 transitions. [2019-11-15 22:49:54,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3154 transitions. [2019-11-15 22:49:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 22:49:54,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:54,937 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 22:49:54,937 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:54,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash 661990378, now seen corresponding path program 1 times [2019-11-15 22:49:54,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:54,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54754080] [2019-11-15 22:49:54,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:54,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:54,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54754080] [2019-11-15 22:49:54,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:54,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:54,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158657852] [2019-11-15 22:49:54,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:54,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:54,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:54,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:54,969 INFO L87 Difference]: Start difference. First operand 1924 states and 3154 transitions. Second operand 3 states. [2019-11-15 22:49:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:55,024 INFO L93 Difference]: Finished difference Result 4552 states and 7508 transitions. [2019-11-15 22:49:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:55,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 22:49:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:55,039 INFO L225 Difference]: With dead ends: 4552 [2019-11-15 22:49:55,040 INFO L226 Difference]: Without dead ends: 2662 [2019-11-15 22:49:55,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-11-15 22:49:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-11-15 22:49:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-11-15 22:49:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4354 transitions. [2019-11-15 22:49:55,115 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4354 transitions. Word has length 25 [2019-11-15 22:49:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:55,115 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 4354 transitions. [2019-11-15 22:49:55,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4354 transitions. [2019-11-15 22:49:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:49:55,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:55,119 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:55,120 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:55,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1041223700, now seen corresponding path program 1 times [2019-11-15 22:49:55,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:55,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977086210] [2019-11-15 22:49:55,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:55,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:55,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:55,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977086210] [2019-11-15 22:49:55,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:55,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:55,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691187386] [2019-11-15 22:49:55,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:55,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:55,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:55,160 INFO L87 Difference]: Start difference. First operand 2660 states and 4354 transitions. Second operand 3 states. [2019-11-15 22:49:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:55,204 INFO L93 Difference]: Finished difference Result 3992 states and 6516 transitions. [2019-11-15 22:49:55,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:55,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 22:49:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:55,219 INFO L225 Difference]: With dead ends: 3992 [2019-11-15 22:49:55,219 INFO L226 Difference]: Without dead ends: 2694 [2019-11-15 22:49:55,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2019-11-15 22:49:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2692. [2019-11-15 22:49:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2019-11-15 22:49:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4354 transitions. [2019-11-15 22:49:55,296 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4354 transitions. Word has length 26 [2019-11-15 22:49:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:55,297 INFO L462 AbstractCegarLoop]: Abstraction has 2692 states and 4354 transitions. [2019-11-15 22:49:55,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4354 transitions. [2019-11-15 22:49:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:49:55,301 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:55,301 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:55,301 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:55,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash -952921006, now seen corresponding path program 1 times [2019-11-15 22:49:55,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:55,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703048222] [2019-11-15 22:49:55,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:55,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:55,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:55,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703048222] [2019-11-15 22:49:55,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:55,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:55,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691367437] [2019-11-15 22:49:55,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:55,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:55,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:55,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:55,326 INFO L87 Difference]: Start difference. First operand 2692 states and 4354 transitions. Second operand 3 states. [2019-11-15 22:49:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:55,387 INFO L93 Difference]: Finished difference Result 4872 states and 8036 transitions. [2019-11-15 22:49:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:55,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 22:49:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:55,417 INFO L225 Difference]: With dead ends: 4872 [2019-11-15 22:49:55,417 INFO L226 Difference]: Without dead ends: 4870 [2019-11-15 22:49:55,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-11-15 22:49:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 3844. [2019-11-15 22:49:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-11-15 22:49:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 6050 transitions. [2019-11-15 22:49:55,542 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 6050 transitions. Word has length 26 [2019-11-15 22:49:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:55,542 INFO L462 AbstractCegarLoop]: Abstraction has 3844 states and 6050 transitions. [2019-11-15 22:49:55,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 6050 transitions. [2019-11-15 22:49:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:49:55,548 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:55,548 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:55,548 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1753698388, now seen corresponding path program 1 times [2019-11-15 22:49:55,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:55,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812933574] [2019-11-15 22:49:55,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:55,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:55,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:55,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812933574] [2019-11-15 22:49:55,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:55,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:55,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415135653] [2019-11-15 22:49:55,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:55,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:55,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:55,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:55,571 INFO L87 Difference]: Start difference. First operand 3844 states and 6050 transitions. Second operand 3 states. [2019-11-15 22:49:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:55,656 INFO L93 Difference]: Finished difference Result 9032 states and 14308 transitions. [2019-11-15 22:49:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:55,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 22:49:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:55,681 INFO L225 Difference]: With dead ends: 9032 [2019-11-15 22:49:55,682 INFO L226 Difference]: Without dead ends: 5254 [2019-11-15 22:49:55,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2019-11-15 22:49:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5252. [2019-11-15 22:49:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2019-11-15 22:49:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8258 transitions. [2019-11-15 22:49:55,828 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8258 transitions. Word has length 26 [2019-11-15 22:49:55,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:55,829 INFO L462 AbstractCegarLoop]: Abstraction has 5252 states and 8258 transitions. [2019-11-15 22:49:55,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8258 transitions. [2019-11-15 22:49:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:49:55,835 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:55,835 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:55,835 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash 524433983, now seen corresponding path program 1 times [2019-11-15 22:49:55,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:55,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045851552] [2019-11-15 22:49:55,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:55,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:55,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:55,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045851552] [2019-11-15 22:49:55,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:55,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:55,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615317788] [2019-11-15 22:49:55,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:55,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:55,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:55,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:55,853 INFO L87 Difference]: Start difference. First operand 5252 states and 8258 transitions. Second operand 3 states. [2019-11-15 22:49:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:55,968 INFO L93 Difference]: Finished difference Result 7880 states and 12356 transitions. [2019-11-15 22:49:55,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:55,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 22:49:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:55,979 INFO L225 Difference]: With dead ends: 7880 [2019-11-15 22:49:55,979 INFO L226 Difference]: Without dead ends: 5318 [2019-11-15 22:49:55,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2019-11-15 22:49:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 5316. [2019-11-15 22:49:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-11-15 22:49:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 8258 transitions. [2019-11-15 22:49:56,109 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 8258 transitions. Word has length 27 [2019-11-15 22:49:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:56,110 INFO L462 AbstractCegarLoop]: Abstraction has 5316 states and 8258 transitions. [2019-11-15 22:49:56,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 8258 transitions. [2019-11-15 22:49:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:49:56,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:56,116 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:56,117 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1469710723, now seen corresponding path program 1 times [2019-11-15 22:49:56,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:56,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221853343] [2019-11-15 22:49:56,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:56,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:56,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:56,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221853343] [2019-11-15 22:49:56,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:56,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:56,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188776166] [2019-11-15 22:49:56,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:56,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:56,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:56,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:56,140 INFO L87 Difference]: Start difference. First operand 5316 states and 8258 transitions. Second operand 3 states. [2019-11-15 22:49:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:56,258 INFO L93 Difference]: Finished difference Result 9480 states and 15044 transitions. [2019-11-15 22:49:56,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:56,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 22:49:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:56,277 INFO L225 Difference]: With dead ends: 9480 [2019-11-15 22:49:56,277 INFO L226 Difference]: Without dead ends: 9478 [2019-11-15 22:49:56,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2019-11-15 22:49:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 7684. [2019-11-15 22:49:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2019-11-15 22:49:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 11586 transitions. [2019-11-15 22:49:56,473 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 11586 transitions. Word has length 27 [2019-11-15 22:49:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:56,473 INFO L462 AbstractCegarLoop]: Abstraction has 7684 states and 11586 transitions. [2019-11-15 22:49:56,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 11586 transitions. [2019-11-15 22:49:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:49:56,484 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:56,485 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:56,485 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1236908671, now seen corresponding path program 1 times [2019-11-15 22:49:56,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:56,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849176978] [2019-11-15 22:49:56,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:56,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:56,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:56,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849176978] [2019-11-15 22:49:56,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:56,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:56,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565323904] [2019-11-15 22:49:56,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:56,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:56,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:56,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:56,509 INFO L87 Difference]: Start difference. First operand 7684 states and 11586 transitions. Second operand 3 states. [2019-11-15 22:49:56,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:56,631 INFO L93 Difference]: Finished difference Result 17928 states and 27204 transitions. [2019-11-15 22:49:56,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:56,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 22:49:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:56,652 INFO L225 Difference]: With dead ends: 17928 [2019-11-15 22:49:56,652 INFO L226 Difference]: Without dead ends: 10374 [2019-11-15 22:49:56,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10374 states. [2019-11-15 22:49:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10374 to 10372. [2019-11-15 22:49:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10372 states. [2019-11-15 22:49:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10372 states to 10372 states and 15618 transitions. [2019-11-15 22:49:56,985 INFO L78 Accepts]: Start accepts. Automaton has 10372 states and 15618 transitions. Word has length 27 [2019-11-15 22:49:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:56,986 INFO L462 AbstractCegarLoop]: Abstraction has 10372 states and 15618 transitions. [2019-11-15 22:49:56,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10372 states and 15618 transitions. [2019-11-15 22:49:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:49:56,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:56,998 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:56,999 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1683822281, now seen corresponding path program 1 times [2019-11-15 22:49:56,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:57,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417345292] [2019-11-15 22:49:57,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:57,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:57,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:57,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417345292] [2019-11-15 22:49:57,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:57,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:57,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886222758] [2019-11-15 22:49:57,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:57,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:57,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:57,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:57,020 INFO L87 Difference]: Start difference. First operand 10372 states and 15618 transitions. Second operand 3 states. [2019-11-15 22:49:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:57,132 INFO L93 Difference]: Finished difference Result 15560 states and 23364 transitions. [2019-11-15 22:49:57,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:57,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 22:49:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:57,152 INFO L225 Difference]: With dead ends: 15560 [2019-11-15 22:49:57,153 INFO L226 Difference]: Without dead ends: 10502 [2019-11-15 22:49:57,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2019-11-15 22:49:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 10500. [2019-11-15 22:49:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10500 states. [2019-11-15 22:49:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 15618 transitions. [2019-11-15 22:49:57,396 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 15618 transitions. Word has length 28 [2019-11-15 22:49:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:57,397 INFO L462 AbstractCegarLoop]: Abstraction has 10500 states and 15618 transitions. [2019-11-15 22:49:57,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 15618 transitions. [2019-11-15 22:49:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:49:57,408 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:57,409 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:57,409 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:57,410 INFO L82 PathProgramCache]: Analyzing trace with hash -310322425, now seen corresponding path program 1 times [2019-11-15 22:49:57,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:57,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439204308] [2019-11-15 22:49:57,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:57,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:57,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:57,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439204308] [2019-11-15 22:49:57,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:57,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:57,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622408633] [2019-11-15 22:49:57,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:57,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:57,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:57,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:57,429 INFO L87 Difference]: Start difference. First operand 10500 states and 15618 transitions. Second operand 3 states. [2019-11-15 22:49:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:57,600 INFO L93 Difference]: Finished difference Result 18440 states and 28036 transitions. [2019-11-15 22:49:57,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:57,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 22:49:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:57,639 INFO L225 Difference]: With dead ends: 18440 [2019-11-15 22:49:57,639 INFO L226 Difference]: Without dead ends: 18438 [2019-11-15 22:49:57,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18438 states. [2019-11-15 22:49:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18438 to 15364. [2019-11-15 22:49:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15364 states. [2019-11-15 22:49:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15364 states to 15364 states and 22146 transitions. [2019-11-15 22:49:58,038 INFO L78 Accepts]: Start accepts. Automaton has 15364 states and 22146 transitions. Word has length 28 [2019-11-15 22:49:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:58,039 INFO L462 AbstractCegarLoop]: Abstraction has 15364 states and 22146 transitions. [2019-11-15 22:49:58,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 15364 states and 22146 transitions. [2019-11-15 22:49:58,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:49:58,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:58,062 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:58,063 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1898670327, now seen corresponding path program 1 times [2019-11-15 22:49:58,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:58,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385201098] [2019-11-15 22:49:58,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:58,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:58,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:58,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385201098] [2019-11-15 22:49:58,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:58,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:58,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840431738] [2019-11-15 22:49:58,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:58,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:58,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:58,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:58,082 INFO L87 Difference]: Start difference. First operand 15364 states and 22146 transitions. Second operand 3 states. [2019-11-15 22:49:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:58,303 INFO L93 Difference]: Finished difference Result 35592 states and 51588 transitions. [2019-11-15 22:49:58,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:58,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 22:49:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:58,342 INFO L225 Difference]: With dead ends: 35592 [2019-11-15 22:49:58,343 INFO L226 Difference]: Without dead ends: 20486 [2019-11-15 22:49:58,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2019-11-15 22:49:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20484. [2019-11-15 22:49:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2019-11-15 22:49:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 29442 transitions. [2019-11-15 22:49:58,789 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 29442 transitions. Word has length 28 [2019-11-15 22:49:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:58,789 INFO L462 AbstractCegarLoop]: Abstraction has 20484 states and 29442 transitions. [2019-11-15 22:49:58,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 29442 transitions. [2019-11-15 22:49:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:49:58,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:58,815 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:58,815 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:58,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1029845804, now seen corresponding path program 1 times [2019-11-15 22:49:58,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:58,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918558710] [2019-11-15 22:49:58,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:58,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:58,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:58,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918558710] [2019-11-15 22:49:58,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:58,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:58,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617972025] [2019-11-15 22:49:58,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:58,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:58,864 INFO L87 Difference]: Start difference. First operand 20484 states and 29442 transitions. Second operand 3 states. [2019-11-15 22:49:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:59,140 INFO L93 Difference]: Finished difference Result 30728 states and 44036 transitions. [2019-11-15 22:49:59,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:59,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 22:49:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:59,175 INFO L225 Difference]: With dead ends: 30728 [2019-11-15 22:49:59,175 INFO L226 Difference]: Without dead ends: 20742 [2019-11-15 22:49:59,187 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20742 states. [2019-11-15 22:49:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20742 to 20740. [2019-11-15 22:49:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20740 states. [2019-11-15 22:49:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20740 states to 20740 states and 29442 transitions. [2019-11-15 22:49:59,564 INFO L78 Accepts]: Start accepts. Automaton has 20740 states and 29442 transitions. Word has length 29 [2019-11-15 22:49:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:59,564 INFO L462 AbstractCegarLoop]: Abstraction has 20740 states and 29442 transitions. [2019-11-15 22:49:59,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:49:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 20740 states and 29442 transitions. [2019-11-15 22:49:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:49:59,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:59,587 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:59,587 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:59,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1270976786, now seen corresponding path program 1 times [2019-11-15 22:49:59,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:59,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413408186] [2019-11-15 22:49:59,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:59,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:59,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:59,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413408186] [2019-11-15 22:49:59,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:59,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:49:59,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175214702] [2019-11-15 22:49:59,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:49:59,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:49:59,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:49:59,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:59,613 INFO L87 Difference]: Start difference. First operand 20740 states and 29442 transitions. Second operand 3 states. [2019-11-15 22:49:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:59,894 INFO L93 Difference]: Finished difference Result 35848 states and 51972 transitions. [2019-11-15 22:49:59,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:49:59,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 22:49:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:59,959 INFO L225 Difference]: With dead ends: 35848 [2019-11-15 22:49:59,959 INFO L226 Difference]: Without dead ends: 35846 [2019-11-15 22:49:59,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:49:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35846 states. [2019-11-15 22:50:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35846 to 30724. [2019-11-15 22:50:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30724 states. [2019-11-15 22:50:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30724 states to 30724 states and 42242 transitions. [2019-11-15 22:50:00,697 INFO L78 Accepts]: Start accepts. Automaton has 30724 states and 42242 transitions. Word has length 29 [2019-11-15 22:50:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:00,697 INFO L462 AbstractCegarLoop]: Abstraction has 30724 states and 42242 transitions. [2019-11-15 22:50:00,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 30724 states and 42242 transitions. [2019-11-15 22:50:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:50:00,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:00,730 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:00,730 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:00,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash -317371116, now seen corresponding path program 1 times [2019-11-15 22:50:00,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:00,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540835778] [2019-11-15 22:50:00,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:00,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:00,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:00,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540835778] [2019-11-15 22:50:00,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:00,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:00,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4868863] [2019-11-15 22:50:00,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:00,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:00,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:00,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:00,749 INFO L87 Difference]: Start difference. First operand 30724 states and 42242 transitions. Second operand 3 states. [2019-11-15 22:50:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:01,098 INFO L93 Difference]: Finished difference Result 70664 states and 97540 transitions. [2019-11-15 22:50:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:01,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 22:50:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:01,154 INFO L225 Difference]: With dead ends: 70664 [2019-11-15 22:50:01,154 INFO L226 Difference]: Without dead ends: 40454 [2019-11-15 22:50:01,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40454 states. [2019-11-15 22:50:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40454 to 40452. [2019-11-15 22:50:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40452 states. [2019-11-15 22:50:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40452 states to 40452 states and 55298 transitions. [2019-11-15 22:50:02,199 INFO L78 Accepts]: Start accepts. Automaton has 40452 states and 55298 transitions. Word has length 29 [2019-11-15 22:50:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:02,199 INFO L462 AbstractCegarLoop]: Abstraction has 40452 states and 55298 transitions. [2019-11-15 22:50:02,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 40452 states and 55298 transitions. [2019-11-15 22:50:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:50:02,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:02,230 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:02,231 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:02,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash 745789822, now seen corresponding path program 1 times [2019-11-15 22:50:02,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:02,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388540667] [2019-11-15 22:50:02,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:02,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:02,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:02,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388540667] [2019-11-15 22:50:02,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:02,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:02,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175951148] [2019-11-15 22:50:02,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:02,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:02,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:02,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:02,250 INFO L87 Difference]: Start difference. First operand 40452 states and 55298 transitions. Second operand 3 states. [2019-11-15 22:50:02,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:02,590 INFO L93 Difference]: Finished difference Result 60680 states and 82692 transitions. [2019-11-15 22:50:02,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:02,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-15 22:50:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:02,647 INFO L225 Difference]: With dead ends: 60680 [2019-11-15 22:50:02,647 INFO L226 Difference]: Without dead ends: 40966 [2019-11-15 22:50:02,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40966 states. [2019-11-15 22:50:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40966 to 40964. [2019-11-15 22:50:03,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40964 states. [2019-11-15 22:50:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40964 states to 40964 states and 55298 transitions. [2019-11-15 22:50:03,658 INFO L78 Accepts]: Start accepts. Automaton has 40964 states and 55298 transitions. Word has length 30 [2019-11-15 22:50:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:03,659 INFO L462 AbstractCegarLoop]: Abstraction has 40964 states and 55298 transitions. [2019-11-15 22:50:03,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 40964 states and 55298 transitions. [2019-11-15 22:50:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:50:03,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:03,680 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:03,680 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1248354884, now seen corresponding path program 1 times [2019-11-15 22:50:03,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:03,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115988451] [2019-11-15 22:50:03,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:03,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:03,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:03,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115988451] [2019-11-15 22:50:03,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:03,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:03,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358848395] [2019-11-15 22:50:03,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:03,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:03,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:03,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:03,705 INFO L87 Difference]: Start difference. First operand 40964 states and 55298 transitions. Second operand 3 states. [2019-11-15 22:50:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:04,311 INFO L93 Difference]: Finished difference Result 119816 states and 159748 transitions. [2019-11-15 22:50:04,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:04,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-15 22:50:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:04,393 INFO L225 Difference]: With dead ends: 119816 [2019-11-15 22:50:04,393 INFO L226 Difference]: Without dead ends: 79878 [2019-11-15 22:50:04,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-11-15 22:50:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 79876. [2019-11-15 22:50:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2019-11-15 22:50:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 104450 transitions. [2019-11-15 22:50:05,980 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 104450 transitions. Word has length 30 [2019-11-15 22:50:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:05,980 INFO L462 AbstractCegarLoop]: Abstraction has 79876 states and 104450 transitions. [2019-11-15 22:50:05,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 104450 transitions. [2019-11-15 22:50:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:50:06,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:06,023 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:06,024 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:06,024 INFO L82 PathProgramCache]: Analyzing trace with hash 339993018, now seen corresponding path program 1 times [2019-11-15 22:50:06,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:06,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076134457] [2019-11-15 22:50:06,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:06,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:06,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:06,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076134457] [2019-11-15 22:50:06,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:06,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:06,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125852463] [2019-11-15 22:50:06,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:06,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:06,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:06,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:06,049 INFO L87 Difference]: Start difference. First operand 79876 states and 104450 transitions. Second operand 3 states. [2019-11-15 22:50:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:06,563 INFO L93 Difference]: Finished difference Result 88072 states and 118788 transitions. [2019-11-15 22:50:06,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:06,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-15 22:50:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:06,635 INFO L225 Difference]: With dead ends: 88072 [2019-11-15 22:50:06,635 INFO L226 Difference]: Without dead ends: 88070 [2019-11-15 22:50:06,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88070 states. [2019-11-15 22:50:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88070 to 79876. [2019-11-15 22:50:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2019-11-15 22:50:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 103426 transitions. [2019-11-15 22:50:08,095 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 103426 transitions. Word has length 30 [2019-11-15 22:50:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:08,095 INFO L462 AbstractCegarLoop]: Abstraction has 79876 states and 103426 transitions. [2019-11-15 22:50:08,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 103426 transitions. [2019-11-15 22:50:08,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:50:08,127 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:08,127 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:08,127 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:08,128 INFO L82 PathProgramCache]: Analyzing trace with hash -44080279, now seen corresponding path program 1 times [2019-11-15 22:50:08,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:08,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493076684] [2019-11-15 22:50:08,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:08,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:08,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:08,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493076684] [2019-11-15 22:50:08,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:08,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:08,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552941267] [2019-11-15 22:50:08,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:08,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:08,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:08,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:08,156 INFO L87 Difference]: Start difference. First operand 79876 states and 103426 transitions. Second operand 3 states. [2019-11-15 22:50:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:08,986 INFO L93 Difference]: Finished difference Result 134152 states and 176132 transitions. [2019-11-15 22:50:08,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:08,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 22:50:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:09,129 INFO L225 Difference]: With dead ends: 134152 [2019-11-15 22:50:09,129 INFO L226 Difference]: Without dead ends: 134150 [2019-11-15 22:50:09,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134150 states. [2019-11-15 22:50:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134150 to 121860. [2019-11-15 22:50:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121860 states. [2019-11-15 22:50:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121860 states to 121860 states and 153602 transitions. [2019-11-15 22:50:11,176 INFO L78 Accepts]: Start accepts. Automaton has 121860 states and 153602 transitions. Word has length 31 [2019-11-15 22:50:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:11,176 INFO L462 AbstractCegarLoop]: Abstraction has 121860 states and 153602 transitions. [2019-11-15 22:50:11,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 121860 states and 153602 transitions. [2019-11-15 22:50:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:50:11,238 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:11,238 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:11,238 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:11,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1632428181, now seen corresponding path program 1 times [2019-11-15 22:50:11,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:11,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601743412] [2019-11-15 22:50:11,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:11,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:11,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:11,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601743412] [2019-11-15 22:50:11,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:11,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:11,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011756195] [2019-11-15 22:50:11,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:11,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:11,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:11,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:11,259 INFO L87 Difference]: Start difference. First operand 121860 states and 153602 transitions. Second operand 3 states. [2019-11-15 22:50:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:14,507 INFO L93 Difference]: Finished difference Result 277512 states and 350212 transitions. [2019-11-15 22:50:14,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:14,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 22:50:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:14,653 INFO L225 Difference]: With dead ends: 277512 [2019-11-15 22:50:14,653 INFO L226 Difference]: Without dead ends: 156678 [2019-11-15 22:50:14,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156678 states. [2019-11-15 22:50:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156678 to 156676. [2019-11-15 22:50:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156676 states. [2019-11-15 22:50:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156676 states to 156676 states and 194562 transitions. [2019-11-15 22:50:17,031 INFO L78 Accepts]: Start accepts. Automaton has 156676 states and 194562 transitions. Word has length 31 [2019-11-15 22:50:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:17,031 INFO L462 AbstractCegarLoop]: Abstraction has 156676 states and 194562 transitions. [2019-11-15 22:50:17,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 156676 states and 194562 transitions. [2019-11-15 22:50:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 22:50:17,093 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:17,093 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:17,094 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:17,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1366272847, now seen corresponding path program 1 times [2019-11-15 22:50:17,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:17,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559719519] [2019-11-15 22:50:17,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:17,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:17,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:17,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559719519] [2019-11-15 22:50:17,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:17,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:17,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786050905] [2019-11-15 22:50:17,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:17,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:17,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:17,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:17,116 INFO L87 Difference]: Start difference. First operand 156676 states and 194562 transitions. Second operand 3 states. [2019-11-15 22:50:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:18,048 INFO L93 Difference]: Finished difference Result 236552 states and 293892 transitions. [2019-11-15 22:50:18,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:18,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-15 22:50:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:18,209 INFO L225 Difference]: With dead ends: 236552 [2019-11-15 22:50:18,209 INFO L226 Difference]: Without dead ends: 159750 [2019-11-15 22:50:18,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:18,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159750 states. [2019-11-15 22:50:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159750 to 159748. [2019-11-15 22:50:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159748 states. [2019-11-15 22:50:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159748 states to 159748 states and 196610 transitions. [2019-11-15 22:50:20,887 INFO L78 Accepts]: Start accepts. Automaton has 159748 states and 196610 transitions. Word has length 32 [2019-11-15 22:50:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:20,887 INFO L462 AbstractCegarLoop]: Abstraction has 159748 states and 196610 transitions. [2019-11-15 22:50:20,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 159748 states and 196610 transitions. [2019-11-15 22:50:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 22:50:20,958 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:20,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:20,958 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:20,959 INFO L82 PathProgramCache]: Analyzing trace with hash 934549743, now seen corresponding path program 1 times [2019-11-15 22:50:20,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:20,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665808480] [2019-11-15 22:50:20,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:20,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:20,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:20,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665808480] [2019-11-15 22:50:20,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:20,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:20,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843941598] [2019-11-15 22:50:20,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:20,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:20,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:20,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:20,984 INFO L87 Difference]: Start difference. First operand 159748 states and 196610 transitions. Second operand 3 states. [2019-11-15 22:50:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:22,483 INFO L93 Difference]: Finished difference Result 262152 states and 323588 transitions. [2019-11-15 22:50:22,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:22,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-15 22:50:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:22,742 INFO L225 Difference]: With dead ends: 262152 [2019-11-15 22:50:22,742 INFO L226 Difference]: Without dead ends: 262150 [2019-11-15 22:50:22,784 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262150 states. [2019-11-15 22:50:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262150 to 245764. [2019-11-15 22:50:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245764 states. [2019-11-15 22:50:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245764 states to 245764 states and 294914 transitions. [2019-11-15 22:50:26,208 INFO L78 Accepts]: Start accepts. Automaton has 245764 states and 294914 transitions. Word has length 32 [2019-11-15 22:50:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:26,208 INFO L462 AbstractCegarLoop]: Abstraction has 245764 states and 294914 transitions. [2019-11-15 22:50:26,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 245764 states and 294914 transitions. [2019-11-15 22:50:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 22:50:26,343 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:26,343 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:26,344 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash -653798159, now seen corresponding path program 1 times [2019-11-15 22:50:26,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:26,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286423111] [2019-11-15 22:50:26,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:26,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:26,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:26,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286423111] [2019-11-15 22:50:26,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:26,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:26,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221611639] [2019-11-15 22:50:26,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:26,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:26,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:26,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:26,371 INFO L87 Difference]: Start difference. First operand 245764 states and 294914 transitions. Second operand 3 states. [2019-11-15 22:50:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:28,345 INFO L93 Difference]: Finished difference Result 552968 states and 659460 transitions. [2019-11-15 22:50:28,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:28,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-15 22:50:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:29,949 INFO L225 Difference]: With dead ends: 552968 [2019-11-15 22:50:29,950 INFO L226 Difference]: Without dead ends: 311302 [2019-11-15 22:50:30,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311302 states. [2019-11-15 22:50:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311302 to 311300. [2019-11-15 22:50:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311300 states. [2019-11-15 22:50:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311300 states to 311300 states and 364546 transitions. [2019-11-15 22:50:40,913 INFO L78 Accepts]: Start accepts. Automaton has 311300 states and 364546 transitions. Word has length 32 [2019-11-15 22:50:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:40,913 INFO L462 AbstractCegarLoop]: Abstraction has 311300 states and 364546 transitions. [2019-11-15 22:50:40,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 311300 states and 364546 transitions. [2019-11-15 22:50:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:50:41,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:41,049 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:41,049 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1093512896, now seen corresponding path program 1 times [2019-11-15 22:50:41,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:41,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890486092] [2019-11-15 22:50:41,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:41,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:41,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:41,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890486092] [2019-11-15 22:50:41,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:41,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:41,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926493135] [2019-11-15 22:50:41,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:41,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:41,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:41,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:41,076 INFO L87 Difference]: Start difference. First operand 311300 states and 364546 transitions. Second operand 3 states. [2019-11-15 22:50:43,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:43,046 INFO L93 Difference]: Finished difference Result 466952 states and 544772 transitions. [2019-11-15 22:50:43,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:43,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 22:50:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:43,388 INFO L225 Difference]: With dead ends: 466952 [2019-11-15 22:50:43,388 INFO L226 Difference]: Without dead ends: 315398 [2019-11-15 22:50:43,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315398 states. [2019-11-15 22:50:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315398 to 315396. [2019-11-15 22:50:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315396 states. [2019-11-15 22:50:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315396 states to 315396 states and 364546 transitions. [2019-11-15 22:50:48,077 INFO L78 Accepts]: Start accepts. Automaton has 315396 states and 364546 transitions. Word has length 33 [2019-11-15 22:50:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:48,077 INFO L462 AbstractCegarLoop]: Abstraction has 315396 states and 364546 transitions. [2019-11-15 22:50:48,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 315396 states and 364546 transitions. [2019-11-15 22:50:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:50:48,225 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:48,225 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1207309694, now seen corresponding path program 1 times [2019-11-15 22:50:48,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:48,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431903082] [2019-11-15 22:50:48,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:48,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:48,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:48,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431903082] [2019-11-15 22:50:48,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:48,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:48,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120994528] [2019-11-15 22:50:48,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:48,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:48,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:48,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:48,249 INFO L87 Difference]: Start difference. First operand 315396 states and 364546 transitions. Second operand 3 states. [2019-11-15 22:50:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:52,021 INFO L93 Difference]: Finished difference Result 507910 states and 581635 transitions. [2019-11-15 22:50:52,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:52,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 22:50:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:52,536 INFO L225 Difference]: With dead ends: 507910 [2019-11-15 22:50:52,536 INFO L226 Difference]: Without dead ends: 507908 [2019-11-15 22:50:52,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507908 states. [2019-11-15 22:50:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507908 to 491524. [2019-11-15 22:50:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491524 states. [2019-11-15 22:50:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491524 states to 491524 states and 557058 transitions. [2019-11-15 22:50:59,825 INFO L78 Accepts]: Start accepts. Automaton has 491524 states and 557058 transitions. Word has length 33 [2019-11-15 22:50:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:59,825 INFO L462 AbstractCegarLoop]: Abstraction has 491524 states and 557058 transitions. [2019-11-15 22:50:59,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 491524 states and 557058 transitions. [2019-11-15 22:51:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:51:00,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:00,098 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:00,099 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -381038208, now seen corresponding path program 1 times [2019-11-15 22:51:00,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:00,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765264998] [2019-11-15 22:51:00,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:00,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:00,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:51:00,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765264998] [2019-11-15 22:51:00,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:00,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:51:00,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53818898] [2019-11-15 22:51:00,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:51:00,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:51:00,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:51:00,120 INFO L87 Difference]: Start difference. First operand 491524 states and 557058 transitions. Second operand 3 states. [2019-11-15 22:51:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:10,388 INFO L93 Difference]: Finished difference Result 1097732 states and 1228802 transitions. [2019-11-15 22:51:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:51:10,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 22:51:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:10,389 INFO L225 Difference]: With dead ends: 1097732 [2019-11-15 22:51:10,389 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:51:10,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:51:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:51:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:51:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:51:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:51:10,593 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-11-15 22:51:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:10,594 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:51:10,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:51:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:51:10,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:51:10,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:51:10,660 INFO L443 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,660 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,660 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,660 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:51:10,660 INFO L446 ceAbstractionStarter]: At program point L218(lines 4 219) the Hoare annotation is: true [2019-11-15 22:51:10,660 INFO L443 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-11-15 22:51:10,660 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-11-15 22:51:10,661 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2019-11-15 22:51:10,661 INFO L443 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,661 INFO L443 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,661 INFO L443 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-15 22:51:10,661 INFO L443 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,661 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,662 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,663 INFO L446 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2019-11-15 22:51:10,663 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,663 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 22:51:10,663 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,663 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:51:10,663 INFO L443 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-15 22:51:10,663 INFO L439 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2019-11-15 22:51:10,663 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,663 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,663 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 22:51:10,663 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 22:51:10,664 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,664 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2019-11-15 22:51:10,664 INFO L443 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,664 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 22:51:10,664 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,664 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,664 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,664 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 22:51:10,664 INFO L446 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2019-11-15 22:51:10,664 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,664 INFO L443 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,665 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 22:51:10,665 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-15 22:51:10,665 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2019-11-15 22:51:10,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:51:10 BoogieIcfgContainer [2019-11-15 22:51:10,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:51:10,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:51:10,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:51:10,674 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:51:10,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:49:53" (3/4) ... [2019-11-15 22:51:10,678 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:51:10,691 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 22:51:10,691 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:51:10,751 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c3008143-4733-4fbd-8c7b-c9e9a141ce21/bin/uautomizer/witness.graphml [2019-11-15 22:51:10,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:51:10,753 INFO L168 Benchmark]: Toolchain (without parser) took 78673.65 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 944.7 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-11-15 22:51:10,754 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:51:10,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:10,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:51:10,755 INFO L168 Benchmark]: Boogie Preprocessor took 48.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:10,755 INFO L168 Benchmark]: RCFGBuilder took 524.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:10,756 INFO L168 Benchmark]: TraceAbstraction took 77669.78 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:51:10,756 INFO L168 Benchmark]: Witness Printer took 77.87 ms. Allocated memory is still 5.8 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:10,758 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 524.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 77669.78 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 77.87 ms. Allocated memory is still 5.8 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Result: SAFE, OverallTime: 77.5s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 33.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4378 SDtfs, 2248 SDslu, 2956 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491524occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 65578 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 16393 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.7s InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 58966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...