./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12.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_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:01:26,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:01:26,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:01:26,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:01:26,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:01:26,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:01:26,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:01:26,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:01:26,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:01:26,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:01:26,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:01:26,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:01:26,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:01:26,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:01:26,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:01:26,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:01:26,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:01:26,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:01:26,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:01:26,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:01:26,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:01:26,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:01:26,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:01:26,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:01:26,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:01:26,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:01:26,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:01:26,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:01:26,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:01:26,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:01:26,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:01:26,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:01:26,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:01:26,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:01:26,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:01:26,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:01:26,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:01:26,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:01:26,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:01:26,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:01:26,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:01:26,392 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:01:26,406 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:01:26,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:01:26,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:01:26,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:01:26,408 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:01:26,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:01:26,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:01:26,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:01:26,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:01:26,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:01:26,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:01:26,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:01:26,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:01:26,412 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:01:26,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:01:26,412 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:01:26,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:01:26,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:01:26,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:01:26,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:01:26,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:01:26,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:01:26,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:01:26,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:01:26,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:01:26,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:01:26,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:01:26,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:01:26,416 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_782c5f47-ca8f-488e-a821-f2aa4549d8d5/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2019-11-15 23:01:26,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:01:26,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:01:26,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:01:26,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:01:26,474 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:01:26,475 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_12.c [2019-11-15 23:01:26,528 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/data/5b08abd41/6d28250146b249e1887e81c21d52a6b0/FLAGdaff5c530 [2019-11-15 23:01:26,888 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:01:26,892 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/sv-benchmarks/c/locks/test_locks_12.c [2019-11-15 23:01:26,903 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/data/5b08abd41/6d28250146b249e1887e81c21d52a6b0/FLAGdaff5c530 [2019-11-15 23:01:27,271 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/data/5b08abd41/6d28250146b249e1887e81c21d52a6b0 [2019-11-15 23:01:27,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:01:27,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:01:27,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:01:27,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:01:27,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:01:27,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1c2c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27, skipping insertion in model container [2019-11-15 23:01:27,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,290 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:01:27,315 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:01:27,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:01:27,569 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:01:27,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:01:27,680 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:01:27,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27 WrapperNode [2019-11-15 23:01:27,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:01:27,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:01:27,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:01:27,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:01:27,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:01:27,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:01:27,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:01:27,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:01:27,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (1/1) ... [2019-11-15 23:01:27,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:01:27,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:01:27,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:01:27,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:01:27,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/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 23:01:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:01:27,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:01:28,145 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:01:28,146 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:01:28,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:01:28 BoogieIcfgContainer [2019-11-15 23:01:28,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:01:28,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:01:28,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:01:28,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:01:28,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:01:27" (1/3) ... [2019-11-15 23:01:28,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a300a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:01:28, skipping insertion in model container [2019-11-15 23:01:28,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:27" (2/3) ... [2019-11-15 23:01:28,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a300a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:01:28, skipping insertion in model container [2019-11-15 23:01:28,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:01:28" (3/3) ... [2019-11-15 23:01:28,155 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-11-15 23:01:28,164 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:01:28,171 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:01:28,195 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:01:28,237 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:01:28,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:01:28,239 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:01:28,239 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:01:28,239 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:01:28,240 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:01:28,240 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:01:28,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:01:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-15 23:01:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:01:28,264 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:28,265 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:01:28,266 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1363603929, now seen corresponding path program 1 times [2019-11-15 23:01:28,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667389025] [2019-11-15 23:01:28,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,471 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 23:01:28,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667389025] [2019-11-15 23:01:28,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:28,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:28,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84288324] [2019-11-15 23:01:28,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:28,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:28,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:28,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:28,495 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-11-15 23:01:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:28,546 INFO L93 Difference]: Finished difference Result 94 states and 168 transitions. [2019-11-15 23:01:28,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:28,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:01:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:28,559 INFO L225 Difference]: With dead ends: 94 [2019-11-15 23:01:28,559 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 23:01:28,562 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 23:01:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 23:01:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-15 23:01:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 23:01:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2019-11-15 23:01:28,601 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 101 transitions. Word has length 18 [2019-11-15 23:01:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:28,602 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 101 transitions. [2019-11-15 23:01:28,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2019-11-15 23:01:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:01:28,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:28,604 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:01:28,604 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,604 INFO L82 PathProgramCache]: Analyzing trace with hash 83740251, now seen corresponding path program 1 times [2019-11-15 23:01:28,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830821851] [2019-11-15 23:01:28,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,662 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 23:01:28,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830821851] [2019-11-15 23:01:28,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:28,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:28,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676885473] [2019-11-15 23:01:28,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:28,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:28,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:28,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:28,666 INFO L87 Difference]: Start difference. First operand 54 states and 101 transitions. Second operand 3 states. [2019-11-15 23:01:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:28,706 INFO L93 Difference]: Finished difference Result 133 states and 248 transitions. [2019-11-15 23:01:28,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:28,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:01:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:28,711 INFO L225 Difference]: With dead ends: 133 [2019-11-15 23:01:28,711 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 23:01:28,712 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 23:01:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 23:01:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-15 23:01:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-15 23:01:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 145 transitions. [2019-11-15 23:01:28,734 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 145 transitions. Word has length 18 [2019-11-15 23:01:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:28,734 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 145 transitions. [2019-11-15 23:01:28,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 145 transitions. [2019-11-15 23:01:28,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:01:28,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:28,737 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:01:28,738 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:28,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,739 INFO L82 PathProgramCache]: Analyzing trace with hash -677738462, now seen corresponding path program 1 times [2019-11-15 23:01:28,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894373104] [2019-11-15 23:01:28,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,788 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 23:01:28,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894373104] [2019-11-15 23:01:28,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:28,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:28,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59021518] [2019-11-15 23:01:28,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:28,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:28,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:28,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:28,790 INFO L87 Difference]: Start difference. First operand 78 states and 145 transitions. Second operand 3 states. [2019-11-15 23:01:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:28,819 INFO L93 Difference]: Finished difference Result 122 states and 221 transitions. [2019-11-15 23:01:28,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:28,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:01:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:28,821 INFO L225 Difference]: With dead ends: 122 [2019-11-15 23:01:28,821 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 23:01:28,822 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 23:01:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 23:01:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-15 23:01:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-15 23:01:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 147 transitions. [2019-11-15 23:01:28,836 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 147 transitions. Word has length 19 [2019-11-15 23:01:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:28,837 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 147 transitions. [2019-11-15 23:01:28,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2019-11-15 23:01:28,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:01:28,837 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:28,838 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:01:28,838 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:28,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1698806816, now seen corresponding path program 1 times [2019-11-15 23:01:28,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037413483] [2019-11-15 23:01:28,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,880 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 23:01:28,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037413483] [2019-11-15 23:01:28,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:28,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:28,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529523624] [2019-11-15 23:01:28,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:28,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:28,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:28,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:28,882 INFO L87 Difference]: Start difference. First operand 81 states and 147 transitions. Second operand 3 states. [2019-11-15 23:01:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:28,906 INFO L93 Difference]: Finished difference Result 156 states and 284 transitions. [2019-11-15 23:01:28,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:28,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:01:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:28,908 INFO L225 Difference]: With dead ends: 156 [2019-11-15 23:01:28,908 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 23:01:28,909 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 23:01:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 23:01:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2019-11-15 23:01:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 23:01:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2019-11-15 23:01:28,924 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 19 [2019-11-15 23:01:28,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:28,924 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2019-11-15 23:01:28,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2019-11-15 23:01:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:01:28,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:28,926 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:01:28,926 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1316296802, now seen corresponding path program 1 times [2019-11-15 23:01:28,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069950091] [2019-11-15 23:01:28,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,009 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 23:01:29,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069950091] [2019-11-15 23:01:29,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:29,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:29,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562442220] [2019-11-15 23:01:29,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:29,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:29,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:29,011 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. Second operand 3 states. [2019-11-15 23:01:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,043 INFO L93 Difference]: Finished difference Result 260 states and 474 transitions. [2019-11-15 23:01:29,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:29,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:01:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:29,045 INFO L225 Difference]: With dead ends: 260 [2019-11-15 23:01:29,045 INFO L226 Difference]: Without dead ends: 156 [2019-11-15 23:01:29,046 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 23:01:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-15 23:01:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-11-15 23:01:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 23:01:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 278 transitions. [2019-11-15 23:01:29,067 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 278 transitions. Word has length 19 [2019-11-15 23:01:29,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:29,068 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 278 transitions. [2019-11-15 23:01:29,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 278 transitions. [2019-11-15 23:01:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:01:29,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:29,069 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 23:01:29,070 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:29,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1123190704, now seen corresponding path program 1 times [2019-11-15 23:01:29,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767725481] [2019-11-15 23:01:29,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,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 23:01:29,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767725481] [2019-11-15 23:01:29,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:29,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:29,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390522545] [2019-11-15 23:01:29,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:29,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:29,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:29,117 INFO L87 Difference]: Start difference. First operand 154 states and 278 transitions. Second operand 3 states. [2019-11-15 23:01:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,133 INFO L93 Difference]: Finished difference Result 233 states and 417 transitions. [2019-11-15 23:01:29,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:29,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 23:01:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:29,135 INFO L225 Difference]: With dead ends: 233 [2019-11-15 23:01:29,135 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 23:01:29,136 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 23:01:29,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 23:01:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-11-15 23:01:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-15 23:01:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 278 transitions. [2019-11-15 23:01:29,146 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 278 transitions. Word has length 20 [2019-11-15 23:01:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:29,146 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 278 transitions. [2019-11-15 23:01:29,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 278 transitions. [2019-11-15 23:01:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:01:29,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:29,148 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 23:01:29,148 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2144259058, now seen corresponding path program 1 times [2019-11-15 23:01:29,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170339536] [2019-11-15 23:01:29,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,212 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 23:01:29,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170339536] [2019-11-15 23:01:29,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:29,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:29,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319218774] [2019-11-15 23:01:29,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:29,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:29,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:29,214 INFO L87 Difference]: Start difference. First operand 156 states and 278 transitions. Second operand 3 states. [2019-11-15 23:01:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,236 INFO L93 Difference]: Finished difference Result 452 states and 808 transitions. [2019-11-15 23:01:29,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:29,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 23:01:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:29,239 INFO L225 Difference]: With dead ends: 452 [2019-11-15 23:01:29,239 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 23:01:29,240 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 23:01:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 23:01:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-15 23:01:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-15 23:01:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 530 transitions. [2019-11-15 23:01:29,256 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 530 transitions. Word has length 20 [2019-11-15 23:01:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:29,256 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 530 transitions. [2019-11-15 23:01:29,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 530 transitions. [2019-11-15 23:01:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:01:29,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:29,258 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 23:01:29,258 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash -864395380, now seen corresponding path program 1 times [2019-11-15 23:01:29,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123533601] [2019-11-15 23:01:29,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,284 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 23:01:29,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123533601] [2019-11-15 23:01:29,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:29,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:29,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578576459] [2019-11-15 23:01:29,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:29,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:29,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:29,286 INFO L87 Difference]: Start difference. First operand 300 states and 530 transitions. Second operand 3 states. [2019-11-15 23:01:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,310 INFO L93 Difference]: Finished difference Result 384 states and 684 transitions. [2019-11-15 23:01:29,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:29,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 23:01:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:29,313 INFO L225 Difference]: With dead ends: 384 [2019-11-15 23:01:29,314 INFO L226 Difference]: Without dead ends: 382 [2019-11-15 23:01:29,315 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 23:01:29,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-15 23:01:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 300. [2019-11-15 23:01:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-15 23:01:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 526 transitions. [2019-11-15 23:01:29,338 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 526 transitions. Word has length 20 [2019-11-15 23:01:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:29,338 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 526 transitions. [2019-11-15 23:01:29,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 526 transitions. [2019-11-15 23:01:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:01:29,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:29,340 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 23:01:29,341 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:29,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2047307977, now seen corresponding path program 1 times [2019-11-15 23:01:29,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863290247] [2019-11-15 23:01:29,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,406 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 23:01:29,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863290247] [2019-11-15 23:01:29,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:29,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:29,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661745914] [2019-11-15 23:01:29,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:29,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:29,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:29,408 INFO L87 Difference]: Start difference. First operand 300 states and 526 transitions. Second operand 3 states. [2019-11-15 23:01:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,441 INFO L93 Difference]: Finished difference Result 564 states and 1000 transitions. [2019-11-15 23:01:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:29,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 23:01:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:29,447 INFO L225 Difference]: With dead ends: 564 [2019-11-15 23:01:29,447 INFO L226 Difference]: Without dead ends: 562 [2019-11-15 23:01:29,448 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 23:01:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-11-15 23:01:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 416. [2019-11-15 23:01:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-15 23:01:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 718 transitions. [2019-11-15 23:01:29,476 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 718 transitions. Word has length 21 [2019-11-15 23:01:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:29,476 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 718 transitions. [2019-11-15 23:01:29,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 718 transitions. [2019-11-15 23:01:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:01:29,484 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:29,484 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 23:01:29,485 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:29,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash 967795641, now seen corresponding path program 1 times [2019-11-15 23:01:29,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16670657] [2019-11-15 23:01:29,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,531 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 23:01:29,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16670657] [2019-11-15 23:01:29,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:29,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:29,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166321899] [2019-11-15 23:01:29,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:29,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:29,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:29,533 INFO L87 Difference]: Start difference. First operand 416 states and 718 transitions. Second operand 3 states. [2019-11-15 23:01:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,573 INFO L93 Difference]: Finished difference Result 996 states and 1728 transitions. [2019-11-15 23:01:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:29,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 23:01:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:29,578 INFO L225 Difference]: With dead ends: 996 [2019-11-15 23:01:29,578 INFO L226 Difference]: Without dead ends: 586 [2019-11-15 23:01:29,584 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 23:01:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-15 23:01:29,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-11-15 23:01:29,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-15 23:01:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1002 transitions. [2019-11-15 23:01:29,615 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1002 transitions. Word has length 21 [2019-11-15 23:01:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:29,615 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1002 transitions. [2019-11-15 23:01:29,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1002 transitions. [2019-11-15 23:01:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:01:29,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:29,618 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 23:01:29,618 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:29,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,619 INFO L82 PathProgramCache]: Analyzing trace with hash 958175875, now seen corresponding path program 1 times [2019-11-15 23:01:29,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492323926] [2019-11-15 23:01:29,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,657 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 23:01:29,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492323926] [2019-11-15 23:01:29,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:29,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:29,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710665612] [2019-11-15 23:01:29,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:29,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:29,659 INFO L87 Difference]: Start difference. First operand 584 states and 1002 transitions. Second operand 3 states. [2019-11-15 23:01:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,689 INFO L93 Difference]: Finished difference Result 884 states and 1512 transitions. [2019-11-15 23:01:29,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:29,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:01:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:29,693 INFO L225 Difference]: With dead ends: 884 [2019-11-15 23:01:29,693 INFO L226 Difference]: Without dead ends: 598 [2019-11-15 23:01:29,694 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 23:01:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-15 23:01:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-11-15 23:01:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-15 23:01:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1010 transitions. [2019-11-15 23:01:29,713 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1010 transitions. Word has length 22 [2019-11-15 23:01:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:29,714 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1010 transitions. [2019-11-15 23:01:29,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1010 transitions. [2019-11-15 23:01:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:01:29,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:29,716 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 23:01:29,717 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:29,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash -62892479, now seen corresponding path program 1 times [2019-11-15 23:01:29,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586109669] [2019-11-15 23:01:29,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,749 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 23:01:29,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586109669] [2019-11-15 23:01:29,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:29,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:29,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842260539] [2019-11-15 23:01:29,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:29,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:29,750 INFO L87 Difference]: Start difference. First operand 596 states and 1010 transitions. Second operand 3 states. [2019-11-15 23:01:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,780 INFO L93 Difference]: Finished difference Result 1096 states and 1884 transitions. [2019-11-15 23:01:29,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:29,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:01:29,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:29,788 INFO L225 Difference]: With dead ends: 1096 [2019-11-15 23:01:29,788 INFO L226 Difference]: Without dead ends: 1094 [2019-11-15 23:01:29,789 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 23:01:29,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-11-15 23:01:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 836. [2019-11-15 23:01:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-11-15 23:01:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1386 transitions. [2019-11-15 23:01:29,818 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1386 transitions. Word has length 22 [2019-11-15 23:01:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:29,818 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1386 transitions. [2019-11-15 23:01:29,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1386 transitions. [2019-11-15 23:01:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:01:29,821 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:29,821 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 23:01:29,822 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1342756157, now seen corresponding path program 1 times [2019-11-15 23:01:29,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050943597] [2019-11-15 23:01:29,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,877 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 23:01:29,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050943597] [2019-11-15 23:01:29,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:29,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:29,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22039098] [2019-11-15 23:01:29,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:29,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:29,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:29,879 INFO L87 Difference]: Start difference. First operand 836 states and 1386 transitions. Second operand 3 states. [2019-11-15 23:01:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,920 INFO L93 Difference]: Finished difference Result 1976 states and 3292 transitions. [2019-11-15 23:01:29,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:29,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:01:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:29,931 INFO L225 Difference]: With dead ends: 1976 [2019-11-15 23:01:29,931 INFO L226 Difference]: Without dead ends: 1158 [2019-11-15 23:01:29,933 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 23:01:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-15 23:01:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-11-15 23:01:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-11-15 23:01:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1906 transitions. [2019-11-15 23:01:29,973 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1906 transitions. Word has length 22 [2019-11-15 23:01:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:29,974 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1906 transitions. [2019-11-15 23:01:29,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1906 transitions. [2019-11-15 23:01:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:01:29,976 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:29,976 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 23:01:29,977 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1949452786, now seen corresponding path program 1 times [2019-11-15 23:01:29,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566475062] [2019-11-15 23:01:29,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:30,014 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 23:01:30,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566475062] [2019-11-15 23:01:30,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:30,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:30,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058806247] [2019-11-15 23:01:30,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:30,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:30,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:30,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:30,016 INFO L87 Difference]: Start difference. First operand 1156 states and 1906 transitions. Second operand 3 states. [2019-11-15 23:01:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:30,045 INFO L93 Difference]: Finished difference Result 1736 states and 2852 transitions. [2019-11-15 23:01:30,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:30,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:01:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:30,052 INFO L225 Difference]: With dead ends: 1736 [2019-11-15 23:01:30,053 INFO L226 Difference]: Without dead ends: 1174 [2019-11-15 23:01:30,055 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 23:01:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-11-15 23:01:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1172. [2019-11-15 23:01:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-11-15 23:01:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1906 transitions. [2019-11-15 23:01:30,092 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1906 transitions. Word has length 23 [2019-11-15 23:01:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:30,094 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1906 transitions. [2019-11-15 23:01:30,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1906 transitions. [2019-11-15 23:01:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:01:30,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:30,097 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 23:01:30,097 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:30,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1324446156, now seen corresponding path program 1 times [2019-11-15 23:01:30,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:30,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176591981] [2019-11-15 23:01:30,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:30,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:30,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:30,122 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 23:01:30,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176591981] [2019-11-15 23:01:30,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:30,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:30,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258932345] [2019-11-15 23:01:30,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:30,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:30,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:30,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:30,124 INFO L87 Difference]: Start difference. First operand 1172 states and 1906 transitions. Second operand 3 states. [2019-11-15 23:01:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:30,159 INFO L93 Difference]: Finished difference Result 2120 states and 3508 transitions. [2019-11-15 23:01:30,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:30,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:01:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:30,172 INFO L225 Difference]: With dead ends: 2120 [2019-11-15 23:01:30,172 INFO L226 Difference]: Without dead ends: 2118 [2019-11-15 23:01:30,174 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 23:01:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-15 23:01:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1668. [2019-11-15 23:01:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-11-15 23:01:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2642 transitions. [2019-11-15 23:01:30,231 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2642 transitions. Word has length 23 [2019-11-15 23:01:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:30,231 INFO L462 AbstractCegarLoop]: Abstraction has 1668 states and 2642 transitions. [2019-11-15 23:01:30,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2642 transitions. [2019-11-15 23:01:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:01:30,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:30,234 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 23:01:30,235 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash 44582478, now seen corresponding path program 1 times [2019-11-15 23:01:30,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:30,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095101339] [2019-11-15 23:01:30,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:30,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:30,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:30,255 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 23:01:30,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095101339] [2019-11-15 23:01:30,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:30,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:30,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777369697] [2019-11-15 23:01:30,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:30,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:30,257 INFO L87 Difference]: Start difference. First operand 1668 states and 2642 transitions. Second operand 3 states. [2019-11-15 23:01:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:30,302 INFO L93 Difference]: Finished difference Result 3912 states and 6228 transitions. [2019-11-15 23:01:30,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:30,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:01:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:30,315 INFO L225 Difference]: With dead ends: 3912 [2019-11-15 23:01:30,316 INFO L226 Difference]: Without dead ends: 2278 [2019-11-15 23:01:30,318 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 23:01:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-11-15 23:01:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2019-11-15 23:01:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-11-15 23:01:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3586 transitions. [2019-11-15 23:01:30,383 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3586 transitions. Word has length 23 [2019-11-15 23:01:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:30,384 INFO L462 AbstractCegarLoop]: Abstraction has 2276 states and 3586 transitions. [2019-11-15 23:01:30,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3586 transitions. [2019-11-15 23:01:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:01:30,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:30,389 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 23:01:30,389 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:30,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:30,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1891627720, now seen corresponding path program 1 times [2019-11-15 23:01:30,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:30,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980617198] [2019-11-15 23:01:30,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:30,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:30,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:30,408 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 23:01:30,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980617198] [2019-11-15 23:01:30,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:30,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:30,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379461265] [2019-11-15 23:01:30,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:30,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:30,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:30,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:30,410 INFO L87 Difference]: Start difference. First operand 2276 states and 3586 transitions. Second operand 3 states. [2019-11-15 23:01:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:30,456 INFO L93 Difference]: Finished difference Result 3416 states and 5364 transitions. [2019-11-15 23:01:30,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:30,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 23:01:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:30,468 INFO L225 Difference]: With dead ends: 3416 [2019-11-15 23:01:30,468 INFO L226 Difference]: Without dead ends: 2310 [2019-11-15 23:01:30,471 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 23:01:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-11-15 23:01:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2308. [2019-11-15 23:01:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-11-15 23:01:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3586 transitions. [2019-11-15 23:01:30,594 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3586 transitions. Word has length 24 [2019-11-15 23:01:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:30,594 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 3586 transitions. [2019-11-15 23:01:30,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2019-11-15 23:01:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:01:30,596 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:30,596 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 23:01:30,596 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:30,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1382271222, now seen corresponding path program 1 times [2019-11-15 23:01:30,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:30,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923427185] [2019-11-15 23:01:30,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:30,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:30,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:30,613 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 23:01:30,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923427185] [2019-11-15 23:01:30,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:30,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:30,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625948166] [2019-11-15 23:01:30,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:30,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:30,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:30,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:30,614 INFO L87 Difference]: Start difference. First operand 2308 states and 3586 transitions. Second operand 3 states. [2019-11-15 23:01:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:30,672 INFO L93 Difference]: Finished difference Result 4104 states and 6500 transitions. [2019-11-15 23:01:30,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:30,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 23:01:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:30,695 INFO L225 Difference]: With dead ends: 4104 [2019-11-15 23:01:30,695 INFO L226 Difference]: Without dead ends: 4102 [2019-11-15 23:01:30,696 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 23:01:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-15 23:01:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3332. [2019-11-15 23:01:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-11-15 23:01:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 5026 transitions. [2019-11-15 23:01:30,788 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 5026 transitions. Word has length 24 [2019-11-15 23:01:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:30,788 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 5026 transitions. [2019-11-15 23:01:30,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 5026 transitions. [2019-11-15 23:01:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:01:30,793 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:30,793 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 23:01:30,793 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash 102407544, now seen corresponding path program 1 times [2019-11-15 23:01:30,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:30,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605944372] [2019-11-15 23:01:30,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:30,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:30,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:30,809 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 23:01:30,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605944372] [2019-11-15 23:01:30,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:30,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:30,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76777020] [2019-11-15 23:01:30,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:30,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:30,811 INFO L87 Difference]: Start difference. First operand 3332 states and 5026 transitions. Second operand 3 states. [2019-11-15 23:01:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:30,884 INFO L93 Difference]: Finished difference Result 7752 states and 11748 transitions. [2019-11-15 23:01:30,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:30,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 23:01:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:30,909 INFO L225 Difference]: With dead ends: 7752 [2019-11-15 23:01:30,909 INFO L226 Difference]: Without dead ends: 4486 [2019-11-15 23:01:30,913 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 23:01:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-11-15 23:01:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4484. [2019-11-15 23:01:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-11-15 23:01:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6722 transitions. [2019-11-15 23:01:31,041 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6722 transitions. Word has length 24 [2019-11-15 23:01:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:31,041 INFO L462 AbstractCegarLoop]: Abstraction has 4484 states and 6722 transitions. [2019-11-15 23:01:31,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6722 transitions. [2019-11-15 23:01:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:01:31,046 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:31,046 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 23:01:31,047 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:31,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:31,047 INFO L82 PathProgramCache]: Analyzing trace with hash -99050333, now seen corresponding path program 1 times [2019-11-15 23:01:31,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:31,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936411393] [2019-11-15 23:01:31,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:31,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:31,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:31,062 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 23:01:31,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936411393] [2019-11-15 23:01:31,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:31,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:31,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807298158] [2019-11-15 23:01:31,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:31,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:31,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:31,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:31,063 INFO L87 Difference]: Start difference. First operand 4484 states and 6722 transitions. Second operand 3 states. [2019-11-15 23:01:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:31,133 INFO L93 Difference]: Finished difference Result 6728 states and 10052 transitions. [2019-11-15 23:01:31,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:31,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:01:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:31,155 INFO L225 Difference]: With dead ends: 6728 [2019-11-15 23:01:31,156 INFO L226 Difference]: Without dead ends: 4550 [2019-11-15 23:01:31,159 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 23:01:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-11-15 23:01:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4548. [2019-11-15 23:01:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2019-11-15 23:01:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 6722 transitions. [2019-11-15 23:01:31,273 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 6722 transitions. Word has length 25 [2019-11-15 23:01:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:31,273 INFO L462 AbstractCegarLoop]: Abstraction has 4548 states and 6722 transitions. [2019-11-15 23:01:31,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6722 transitions. [2019-11-15 23:01:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:01:31,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:31,279 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 23:01:31,279 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:31,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1120118687, now seen corresponding path program 1 times [2019-11-15 23:01:31,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:31,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129029634] [2019-11-15 23:01:31,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:31,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:31,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:31,295 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 23:01:31,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129029634] [2019-11-15 23:01:31,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:31,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:31,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911867010] [2019-11-15 23:01:31,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:31,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:31,296 INFO L87 Difference]: Start difference. First operand 4548 states and 6722 transitions. Second operand 3 states. [2019-11-15 23:01:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:31,392 INFO L93 Difference]: Finished difference Result 7944 states and 11972 transitions. [2019-11-15 23:01:31,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:31,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:01:31,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:31,408 INFO L225 Difference]: With dead ends: 7944 [2019-11-15 23:01:31,408 INFO L226 Difference]: Without dead ends: 7942 [2019-11-15 23:01:31,411 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 23:01:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2019-11-15 23:01:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 6660. [2019-11-15 23:01:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-15 23:01:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9538 transitions. [2019-11-15 23:01:31,578 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9538 transitions. Word has length 25 [2019-11-15 23:01:31,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:31,578 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 9538 transitions. [2019-11-15 23:01:31,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9538 transitions. [2019-11-15 23:01:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:01:31,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:31,588 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 23:01:31,588 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:31,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1894984931, now seen corresponding path program 1 times [2019-11-15 23:01:31,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:31,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483471846] [2019-11-15 23:01:31,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:31,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:31,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:31,603 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 23:01:31,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483471846] [2019-11-15 23:01:31,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:31,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:31,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846354646] [2019-11-15 23:01:31,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:31,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:31,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:31,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:31,605 INFO L87 Difference]: Start difference. First operand 6660 states and 9538 transitions. Second operand 3 states. [2019-11-15 23:01:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:31,739 INFO L93 Difference]: Finished difference Result 15368 states and 22084 transitions. [2019-11-15 23:01:31,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:31,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:01:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:31,757 INFO L225 Difference]: With dead ends: 15368 [2019-11-15 23:01:31,757 INFO L226 Difference]: Without dead ends: 8838 [2019-11-15 23:01:31,766 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 23:01:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8838 states. [2019-11-15 23:01:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8838 to 8836. [2019-11-15 23:01:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-11-15 23:01:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 12546 transitions. [2019-11-15 23:01:32,097 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 12546 transitions. Word has length 25 [2019-11-15 23:01:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:32,097 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 12546 transitions. [2019-11-15 23:01:32,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 12546 transitions. [2019-11-15 23:01:32,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:01:32,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:32,107 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 23:01:32,107 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:32,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:32,108 INFO L82 PathProgramCache]: Analyzing trace with hash -363725843, now seen corresponding path program 1 times [2019-11-15 23:01:32,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:32,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443811121] [2019-11-15 23:01:32,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:32,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:32,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:32,123 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 23:01:32,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443811121] [2019-11-15 23:01:32,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:32,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:32,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147030917] [2019-11-15 23:01:32,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:32,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:32,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:32,125 INFO L87 Difference]: Start difference. First operand 8836 states and 12546 transitions. Second operand 3 states. [2019-11-15 23:01:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:32,238 INFO L93 Difference]: Finished difference Result 13256 states and 18756 transitions. [2019-11-15 23:01:32,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:32,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:01:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:32,256 INFO L225 Difference]: With dead ends: 13256 [2019-11-15 23:01:32,256 INFO L226 Difference]: Without dead ends: 8966 [2019-11-15 23:01:32,263 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 23:01:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-11-15 23:01:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 8964. [2019-11-15 23:01:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2019-11-15 23:01:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 12546 transitions. [2019-11-15 23:01:32,467 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 12546 transitions. Word has length 26 [2019-11-15 23:01:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:32,467 INFO L462 AbstractCegarLoop]: Abstraction has 8964 states and 12546 transitions. [2019-11-15 23:01:32,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 12546 transitions. [2019-11-15 23:01:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:01:32,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:32,477 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 23:01:32,477 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:32,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:32,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1384794197, now seen corresponding path program 1 times [2019-11-15 23:01:32,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:32,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226746133] [2019-11-15 23:01:32,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:32,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:32,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:32,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226746133] [2019-11-15 23:01:32,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:32,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:32,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032548567] [2019-11-15 23:01:32,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:32,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:32,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:32,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:32,494 INFO L87 Difference]: Start difference. First operand 8964 states and 12546 transitions. Second operand 3 states. [2019-11-15 23:01:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:32,669 INFO L93 Difference]: Finished difference Result 15368 states and 21892 transitions. [2019-11-15 23:01:32,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:32,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:01:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:32,696 INFO L225 Difference]: With dead ends: 15368 [2019-11-15 23:01:32,697 INFO L226 Difference]: Without dead ends: 15366 [2019-11-15 23:01:32,701 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 23:01:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2019-11-15 23:01:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 13316. [2019-11-15 23:01:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13316 states. [2019-11-15 23:01:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13316 states to 13316 states and 18050 transitions. [2019-11-15 23:01:32,956 INFO L78 Accepts]: Start accepts. Automaton has 13316 states and 18050 transitions. Word has length 26 [2019-11-15 23:01:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:32,956 INFO L462 AbstractCegarLoop]: Abstraction has 13316 states and 18050 transitions. [2019-11-15 23:01:32,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 13316 states and 18050 transitions. [2019-11-15 23:01:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:01:32,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:32,974 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 23:01:32,974 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:32,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1630309421, now seen corresponding path program 1 times [2019-11-15 23:01:32,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:32,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139609488] [2019-11-15 23:01:32,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:32,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:32,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:32,990 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 23:01:32,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139609488] [2019-11-15 23:01:32,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:32,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:32,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940763117] [2019-11-15 23:01:32,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:32,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:32,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:32,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:32,992 INFO L87 Difference]: Start difference. First operand 13316 states and 18050 transitions. Second operand 3 states. [2019-11-15 23:01:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:33,209 INFO L93 Difference]: Finished difference Result 30472 states and 41348 transitions. [2019-11-15 23:01:33,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:33,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:01:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:33,241 INFO L225 Difference]: With dead ends: 30472 [2019-11-15 23:01:33,241 INFO L226 Difference]: Without dead ends: 17414 [2019-11-15 23:01:33,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 23:01:33,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17414 states. [2019-11-15 23:01:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17414 to 17412. [2019-11-15 23:01:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-11-15 23:01:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 23298 transitions. [2019-11-15 23:01:33,707 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 23298 transitions. Word has length 26 [2019-11-15 23:01:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:33,707 INFO L462 AbstractCegarLoop]: Abstraction has 17412 states and 23298 transitions. [2019-11-15 23:01:33,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 23298 transitions. [2019-11-15 23:01:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:01:33,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:33,726 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 23:01:33,727 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:33,727 INFO L82 PathProgramCache]: Analyzing trace with hash 21268280, now seen corresponding path program 1 times [2019-11-15 23:01:33,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:33,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320775629] [2019-11-15 23:01:33,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:33,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:33,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:33,744 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 23:01:33,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320775629] [2019-11-15 23:01:33,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:33,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:33,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568855059] [2019-11-15 23:01:33,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:33,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:33,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:33,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:33,746 INFO L87 Difference]: Start difference. First operand 17412 states and 23298 transitions. Second operand 3 states. [2019-11-15 23:01:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:33,929 INFO L93 Difference]: Finished difference Result 26120 states and 34820 transitions. [2019-11-15 23:01:33,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:33,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:01:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:33,957 INFO L225 Difference]: With dead ends: 26120 [2019-11-15 23:01:33,957 INFO L226 Difference]: Without dead ends: 17670 [2019-11-15 23:01:33,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 23:01:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2019-11-15 23:01:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17668. [2019-11-15 23:01:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17668 states. [2019-11-15 23:01:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17668 states to 17668 states and 23298 transitions. [2019-11-15 23:01:34,290 INFO L78 Accepts]: Start accepts. Automaton has 17668 states and 23298 transitions. Word has length 27 [2019-11-15 23:01:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:34,290 INFO L462 AbstractCegarLoop]: Abstraction has 17668 states and 23298 transitions. [2019-11-15 23:01:34,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 17668 states and 23298 transitions. [2019-11-15 23:01:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:01:34,309 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:34,309 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 23:01:34,309 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:34,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:34,310 INFO L82 PathProgramCache]: Analyzing trace with hash -999800074, now seen corresponding path program 1 times [2019-11-15 23:01:34,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:34,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200855458] [2019-11-15 23:01:34,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:34,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:34,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:34,335 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 23:01:34,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200855458] [2019-11-15 23:01:34,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:34,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:34,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799812608] [2019-11-15 23:01:34,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:34,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:34,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:34,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:34,337 INFO L87 Difference]: Start difference. First operand 17668 states and 23298 transitions. Second operand 3 states. [2019-11-15 23:01:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:34,728 INFO L93 Difference]: Finished difference Result 29704 states and 39684 transitions. [2019-11-15 23:01:34,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:34,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:01:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:34,772 INFO L225 Difference]: With dead ends: 29704 [2019-11-15 23:01:34,773 INFO L226 Difference]: Without dead ends: 29702 [2019-11-15 23:01:34,777 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 23:01:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29702 states. [2019-11-15 23:01:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29702 to 26628. [2019-11-15 23:01:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26628 states. [2019-11-15 23:01:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26628 states to 26628 states and 34050 transitions. [2019-11-15 23:01:35,245 INFO L78 Accepts]: Start accepts. Automaton has 26628 states and 34050 transitions. Word has length 27 [2019-11-15 23:01:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:35,245 INFO L462 AbstractCegarLoop]: Abstraction has 26628 states and 34050 transitions. [2019-11-15 23:01:35,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 26628 states and 34050 transitions. [2019-11-15 23:01:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:01:35,277 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:35,278 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 23:01:35,278 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:35,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2015303544, now seen corresponding path program 1 times [2019-11-15 23:01:35,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:35,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737049781] [2019-11-15 23:01:35,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:35,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:35,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:35,293 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 23:01:35,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737049781] [2019-11-15 23:01:35,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:35,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:35,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121547931] [2019-11-15 23:01:35,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:35,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:35,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:35,295 INFO L87 Difference]: Start difference. First operand 26628 states and 34050 transitions. Second operand 3 states. [2019-11-15 23:01:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:35,658 INFO L93 Difference]: Finished difference Result 60424 states and 77060 transitions. [2019-11-15 23:01:35,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:35,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:01:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:35,711 INFO L225 Difference]: With dead ends: 60424 [2019-11-15 23:01:35,712 INFO L226 Difference]: Without dead ends: 34310 [2019-11-15 23:01:35,741 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 23:01:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34310 states. [2019-11-15 23:01:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34310 to 34308. [2019-11-15 23:01:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34308 states. [2019-11-15 23:01:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34308 states to 34308 states and 43010 transitions. [2019-11-15 23:01:36,565 INFO L78 Accepts]: Start accepts. Automaton has 34308 states and 43010 transitions. Word has length 27 [2019-11-15 23:01:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:36,565 INFO L462 AbstractCegarLoop]: Abstraction has 34308 states and 43010 transitions. [2019-11-15 23:01:36,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 34308 states and 43010 transitions. [2019-11-15 23:01:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:01:36,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:36,592 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 23:01:36,593 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:36,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash -928815454, now seen corresponding path program 1 times [2019-11-15 23:01:36,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:36,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703312459] [2019-11-15 23:01:36,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:36,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:36,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:36,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703312459] [2019-11-15 23:01:36,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:36,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:36,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731672995] [2019-11-15 23:01:36,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:36,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:36,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:36,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:36,610 INFO L87 Difference]: Start difference. First operand 34308 states and 43010 transitions. Second operand 3 states. [2019-11-15 23:01:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:36,920 INFO L93 Difference]: Finished difference Result 51464 states and 64260 transitions. [2019-11-15 23:01:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:36,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 23:01:36,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:36,973 INFO L225 Difference]: With dead ends: 51464 [2019-11-15 23:01:36,973 INFO L226 Difference]: Without dead ends: 34822 [2019-11-15 23:01:36,989 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 23:01:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34822 states. [2019-11-15 23:01:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34822 to 34820. [2019-11-15 23:01:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34820 states. [2019-11-15 23:01:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34820 states to 34820 states and 43010 transitions. [2019-11-15 23:01:37,530 INFO L78 Accepts]: Start accepts. Automaton has 34820 states and 43010 transitions. Word has length 28 [2019-11-15 23:01:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:37,530 INFO L462 AbstractCegarLoop]: Abstraction has 34820 states and 43010 transitions. [2019-11-15 23:01:37,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34820 states and 43010 transitions. [2019-11-15 23:01:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:01:37,548 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:37,549 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 23:01:37,549 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:37,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:37,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1949883808, now seen corresponding path program 1 times [2019-11-15 23:01:37,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:37,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116389082] [2019-11-15 23:01:37,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:37,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:37,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:37,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 23:01:37,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116389082] [2019-11-15 23:01:37,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:37,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:37,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746424283] [2019-11-15 23:01:37,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:37,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:37,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:37,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:37,567 INFO L87 Difference]: Start difference. First operand 34820 states and 43010 transitions. Second operand 3 states. [2019-11-15 23:01:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:38,372 INFO L93 Difference]: Finished difference Result 101384 states and 122884 transitions. [2019-11-15 23:01:38,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:38,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 23:01:38,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:38,444 INFO L225 Difference]: With dead ends: 101384 [2019-11-15 23:01:38,444 INFO L226 Difference]: Without dead ends: 67590 [2019-11-15 23:01:38,466 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 23:01:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2019-11-15 23:01:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67588. [2019-11-15 23:01:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-11-15 23:01:39,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 79874 transitions. [2019-11-15 23:01:39,637 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 79874 transitions. Word has length 28 [2019-11-15 23:01:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:39,637 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 79874 transitions. [2019-11-15 23:01:39,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 79874 transitions. [2019-11-15 23:01:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:01:39,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:39,692 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 23:01:39,693 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:39,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash -670020130, now seen corresponding path program 1 times [2019-11-15 23:01:39,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:39,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724607424] [2019-11-15 23:01:39,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:39,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:39,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:39,714 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 23:01:39,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724607424] [2019-11-15 23:01:39,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:39,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:39,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948167640] [2019-11-15 23:01:39,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:39,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:39,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:39,716 INFO L87 Difference]: Start difference. First operand 67588 states and 79874 transitions. Second operand 3 states. [2019-11-15 23:01:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:40,951 INFO L93 Difference]: Finished difference Result 71688 states and 86020 transitions. [2019-11-15 23:01:40,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:40,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 23:01:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:41,035 INFO L225 Difference]: With dead ends: 71688 [2019-11-15 23:01:41,035 INFO L226 Difference]: Without dead ends: 71686 [2019-11-15 23:01:41,047 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 23:01:41,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71686 states. [2019-11-15 23:01:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71686 to 67588. [2019-11-15 23:01:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-11-15 23:01:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 78850 transitions. [2019-11-15 23:01:42,113 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 78850 transitions. Word has length 28 [2019-11-15 23:01:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:42,113 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 78850 transitions. [2019-11-15 23:01:42,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 78850 transitions. [2019-11-15 23:01:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:01:42,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:42,156 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 23:01:42,156 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash -316639795, now seen corresponding path program 1 times [2019-11-15 23:01:42,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:42,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966640805] [2019-11-15 23:01:42,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:42,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:42,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:42,184 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 23:01:42,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966640805] [2019-11-15 23:01:42,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:42,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:42,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450489939] [2019-11-15 23:01:42,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:42,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:42,186 INFO L87 Difference]: Start difference. First operand 67588 states and 78850 transitions. Second operand 3 states. [2019-11-15 23:01:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:43,674 INFO L93 Difference]: Finished difference Result 109574 states and 126979 transitions. [2019-11-15 23:01:43,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:43,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 23:01:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:43,798 INFO L225 Difference]: With dead ends: 109574 [2019-11-15 23:01:43,799 INFO L226 Difference]: Without dead ends: 109572 [2019-11-15 23:01:43,817 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 23:01:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109572 states. [2019-11-15 23:01:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109572 to 105476. [2019-11-15 23:01:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105476 states. [2019-11-15 23:01:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105476 states to 105476 states and 120834 transitions. [2019-11-15 23:01:45,033 INFO L78 Accepts]: Start accepts. Automaton has 105476 states and 120834 transitions. Word has length 29 [2019-11-15 23:01:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:45,033 INFO L462 AbstractCegarLoop]: Abstraction has 105476 states and 120834 transitions. [2019-11-15 23:01:45,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 105476 states and 120834 transitions. [2019-11-15 23:01:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:01:45,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:01:45,114 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 23:01:45,114 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:01:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:45,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1596503473, now seen corresponding path program 1 times [2019-11-15 23:01:45,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:45,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987538059] [2019-11-15 23:01:45,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:45,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:45,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:45,132 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 23:01:45,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987538059] [2019-11-15 23:01:45,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:45,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:45,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689044902] [2019-11-15 23:01:45,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:01:45,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:45,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:01:45,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:01:45,134 INFO L87 Difference]: Start difference. First operand 105476 states and 120834 transitions. Second operand 3 states. [2019-11-15 23:01:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:46,890 INFO L93 Difference]: Finished difference Result 236548 states and 268290 transitions. [2019-11-15 23:01:46,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:01:46,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 23:01:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:01:46,891 INFO L225 Difference]: With dead ends: 236548 [2019-11-15 23:01:46,891 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:01:46,981 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 23:01:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:01:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:01:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:01:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:01:46,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-15 23:01:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:01:46,983 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:01:46,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:01:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:01:46,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:01:46,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:01:47,018 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,018 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,018 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,018 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 23:01:47,018 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:01:47,018 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:01:47,019 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-15 23:01:47,019 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 23:01:47,019 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,019 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,019 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,019 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,019 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-15 23:01:47,019 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,019 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 23:01:47,019 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,020 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-11-15 23:01:47,020 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,020 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,020 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-11-15 23:01:47,020 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,020 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,020 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 23:01:47,020 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 23:01:47,021 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,021 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,021 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-11-15 23:01:47,021 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 23:01:47,021 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:01:47,021 INFO L446 ceAbstractionStarter]: At program point L190(lines 4 191) the Hoare annotation is: true [2019-11-15 23:01:47,021 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 23:01:47,021 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-15 23:01:47,022 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-11-15 23:01:47,022 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,022 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-11-15 23:01:47,022 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,022 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,022 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,022 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,023 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,023 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,023 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 23:01:47,023 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-11-15 23:01:47,023 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-11-15 23:01:47,023 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-15 23:01:47,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:01:47 BoogieIcfgContainer [2019-11-15 23:01:47,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:01:47,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:01:47,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:01:47,031 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:01:47,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:01:28" (3/4) ... [2019-11-15 23:01:47,035 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:01:47,046 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 23:01:47,047 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:01:47,120 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_782c5f47-ca8f-488e-a821-f2aa4549d8d5/bin/uautomizer/witness.graphml [2019-11-15 23:01:47,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:01:47,122 INFO L168 Benchmark]: Toolchain (without parser) took 19846.44 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 950.1 MB in the beginning and 1.6 GB in the end (delta: -646.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:01:47,122 INFO L168 Benchmark]: CDTParser took 0.18 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 23:01:47,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -218.1 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:01:47,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:01:47,123 INFO L168 Benchmark]: Boogie Preprocessor took 26.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:01:47,123 INFO L168 Benchmark]: RCFGBuilder took 399.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:01:47,124 INFO L168 Benchmark]: TraceAbstraction took 18882.28 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -479.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:01:47,124 INFO L168 Benchmark]: Witness Printer took 89.24 ms. Allocated memory is still 2.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:01:47,126 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.18 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 404.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -218.1 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 399.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18882.28 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -479.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 89.24 ms. Allocated memory is still 2.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. Result: SAFE, OverallTime: 18.7s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3198 SDtfs, 1629 SDslu, 2141 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105476occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 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.6s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 38061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...